March 15

... turn on recording.

Questions about anything?

homework

1st : discuss the homework due today.

2nd : new topic - start looking at sorting algorithms ...

(I've decided to postpone more data structures until a bit later, so that we get to sorting in time for midterm projects.)

Breakout rooms :

exercise 1 : in english, describe a sorting algorithm ... not fastest; just how do you put cards in order?

Come back together; compare notes.

exercise 2 : in python, working on a list of numbers like [2, 1, 10, 12], implement one of those.

For class next time :

Read about some of the classic sorting algorithms, their O() behaviors, and their properties. Read about at least
- insertion sort
- quick sort
Debug the code that we worked on in class, which is attached.
By Thursday I'll have a an assignment for next Monday to look at them.
Coming soon: midterm project : discuss, implement, show O() behavior of a sorting algorithm (that we didn't do in class) of your choice using numerical experiments with random arrays.