Algorithms
Lesson 25:
Algorithms
AP Computer Science - Unit Three
Algorithms
Algorithms must: Have an order Have clear instructions
AP Computer Science - Unit Three
Algorithms
Algorithms must: operations that can be done by a computer produce a result stop in a finite amount of time
AP Computer Science - Unit Three
Algorithms
So what makes a good algorithm? Speed? Easier to Code? Memory Use? Easy to maintain? Security? Reliability? How do we measure these?
AP Computer Science - Unit Three
Algorithms
Why analyze algorithms? predict performance Does this work? Will it work if ...? make decisions Which algorithm is best in this circumstance?
AP Computer Science - Unit Three
Algorithms
Sieve of Eratosthenes 1 11 21 31 41
2 12 22 32 42
3 13 23 33 43
4 14 24 34 44
5 15 25 35 45
6 16 26 36 46
7 17 27 37 47
8 18 28 38 48
9 19 29 39 49
10 20 30 40 50
AP Computer Science - Unit Three
Algorithms
AP Computer Science - Unit Three
Algorithms
Algorithms must: Have an order Have clear instructions
AP Computer Science - Unit Three
Algorithms
Algorithms must: operations that can be done by a computer produce a result stop in a finite amount of time
AP Computer Science - Unit Three
Algorithms
So what makes a good algorithm? Speed? Easier to Code? Memory Use? Easy to maintain? Security? Reliability? How do we measure these?
AP Computer Science - Unit Three
Algorithms
Why analyze algorithms? predict performance Does this work? Will it work if ...? make decisions Which algorithm is best in this circumstance?
AP Computer Science - Unit Three
Algorithms
Sieve of Eratosthenes 1 11 21 31 41
2 12 22 32 42
3 13 23 33 43
4 14 24 34 44
5 15 25 35 45
6 16 26 36 46
7 17 27 37 47
8 18 28 38 48
9 19 29 39 49
10 20 30 40 50
AP Computer Science - Unit Three
