be able to code and use a linear search (breaking out when found)
be able to code and use a binary search
be able to code a bubble, selection and insertion sort
understand algorithmic strategies behind a quicksort, mergsort and heap sort
understand difference in timing and strategy between quadratic and logarithmic sorts
| HOME |