Conclusion
At this point, we expect you to be able to relate the various sorting methods you've seen. This might include playing a different kind of Sort Detective, where the user infers the algorithm from a sequence of changes to the items being sorted. Questions such as "to sort a linked list of elements that are almost in order, name a method you might use and a method you should not use" are appropriate.
Homework Submission
- Remember to fill out the two forms from the previous lab on sorting. They are part of today's homework.
- Complete the homework activity listed in
~cs61bl/code/lab26/hw19.pdf
.
Reading Assignment
- Kimberly White: 2-3 Trees
- Prof. Shewchuk: Splay Trees
- Patrick Lutz: AVL Trees