Comp 271-400 Week 7

Lewis Tower 415, 4:15-8:15



    Bailey chapter 6, sorting: selection sort, insertion sort, mergesort, quicksort.

    Morin chapter 1, sections 1.1 and 1.2
        One slight peculiarity of Morin is that he refers to the array-based List implementation of chapter 2 as an ArrayStack.

The iterator in Traversers

Zuul and Light


Tree Rotations: hard AVL case

B-Trees: again

C++ Smart Pointers