Mar 7
Any questions about the midterm project assignment?
Continue discussion of sorting.
- A variation on insertion sort.
- The trick is to understand why is this even a good idea.
- implement it? (If so, need to write insertion sort first.)
- A divide-and-conquer - one of most popular today
- ... even though worst case is O(n**2)
- many variations
- implement it? (If so need to choose how to pick pivot.)
We translated the wikipedia quicksort pseudo code to python and walked through it. The translation is attached.
others? maybe merge sort or radix sort
(Know what else started in 1959? Me.)
![[paper clip]](/courses/source/wiki_images/paper_clip_tilt.png)
name last modified size
