AP Java Unit 3 Strings & Arrays

Lesson 3: Common algorithms traversals , insertions & deletions

Algorithms must: have an order. have clear instructions. operations that can be done by a computer. produce a result stop in a finite amount of time.

So what makes a good algorithm? Speed? Easier to Code? Memory Use? Easy to maintain? Security? Reliability? How doe we measure these? Depends on the problem

Why analyze algorithms? predict performance Does this work? Will it work if ...? make decisions which algorithm is best in this circumstance?

Example Uses: DVD's MP3's JPEG MRI's All these technologies use Discrete Fourier transformation to compress data.

Legos: We'll do these in class