Algorithms pseudocode; examples
LECTURE 2:
Algorithms pseudocode; examples
Algorithmics - Lecture 2
1
Organizational:
Webpage: up and running. Newsgroup: algouvt on yahoo groups. Please
subscribe. First homework: posted tomorrow on the
webpage. DEADLINE (firm): Friday, October 19, 5pm.
Algorithmics - Lecture 2
2
Outline
? Continue with algorithms/pseudocode from last time. ? Describe some simple algorithms
? Decomposing problems in subproblems and algorithms in subalgorithms
Algorithmics - Lecture 2
3
Properties an algorithm should have
? Generality
? Finiteness
? Non-ambiguity
? Efficiency
Algorithms - Lecture 1
4
Efficiency
An algorithm should use a reasonable amount of computing resources: memory and time
Finiteness is not enough if we have to wait too much to obtain the result
Example: Consider a dictionary containing 50000 words. Write an algorithm that takes a word as input and returns all
anagrams of that word appearing in the dictionary.
Example of anagram: ship -> hips
Algorithms - Lecture 1
5
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- python programming 2 regular expressions lists
- algorithms pseudocode examples
- abstract data types adt s
- algorithmic thinking loops and conditionals
- search command cheatsheet
- complete guide for python programming
- chapter 9 scraping sites that use javascript and ajax
- resume ranking using nlp and machine learning
- s python cheat sheet data science free
- unit 5c merge sort
Related searches
- pseudocode examples and answers
- acls algorithms 2019
- acls algorithms pdf
- acls algorithms 2020
- acls aha algorithms 2020
- 2015 pals algorithms pdf download
- acls algorithms printable
- 2020 acls algorithms aha
- pseudocode examples python
- acls algorithms complete pdf
- acls 2015 algorithms printable
- acls algorithms 2015 pdf