Comp 271-400 Week 5

Lewis Tower 415, 4:15-8:15

Welcome

Readings:

    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.



Recursion and expressions




StrTree insertion code (demos/simpletrees)
    search, etc

Lab 5

Traversers

Stacks
Queues