CS153, Class 25: Lab on Fast Sorting Algorithms

Topics:
* Questions on sorting?
* Lab

Notes:
* Happy Seuss-week
* Apples and granola bars
* Reading: Randomness and Simulation.
* Questions on the lab writeup.
* Homework 2 due. 
  + Warning!  I will post your evaluations (not to plans)
    (I will not post letter grades).

----------------------------------------

Reflection:

* You don't have to write a procedure for everything!
(merge (list "alpha" "beta") (list "delta" "epsilon"))

* Boy, you're good at making Cassie and me feel useless.

* Which 'split' do you prefer?  Why?
  + Prefers original:
    Katherine "splits down the middle; same running time"
  + Prefers new:
    Oge "short and sweet"
    Arjun "more interesting"

* < vs. <= in sorting (insertion, merge, whatever)?
  + Different behavior when two items are equal.

* What did you think of new-merge-sort?
  + It's cool.
  + "Less" recursion (no splitting)
  + Easier to make tail-recursive.

* What should happen with (quicksort (list 1 2 3 4 5) <= =)
  Why?

* Why is (quicksort (random-list 100 100) < =) not a good test?

* How can you do without 'same?'?