Transcription of Algorithms pseudocode; examples - Gabriel Istrate
{{id}} {{{paragraph}}}
Example: bachelor of science
Algorithms pseudocode; examples - Gabriel Istrate
Algorithmics - Lecture 21 LECTURE 2: Algorithms pseudocode ; examples Algorithmics - Lecture 22 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 23 Outline Continue with Algorithms / pseudocode from last time. Describe some simple Algorithms Decomposing problems in subproblems and Algorithms in subalgorithmsAlgorithms - Lecture 14 Properties an algorithm should have Generality Finiteness Non-ambiguity EfficiencyAlgorithms - Lecture 15 EfficiencyAn algorithm should use a reasonable amount of computing resources: memory and timeFiniteness is not enough if we have to wait too much to obtain the resultExample: 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.
<S1> <S2> <S> True False True False Conditional statement • Aim: choosing between two or several alternatives depending on the value of some conditions • General variant: if <condition> then <S1> else <S2> endif • Simplified variant: if <condition> then <S> endif
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: