Lectures -- CS 241 Data Structures 2017
- CS241 Lecture 22, 4/20 our last sort - shell sort... plus graphical tic tac toe
- CS241 Lecture 21, 4/18 our last data structure - hashtable
- CS241 Lecture 20, 4/11, nope, 4/13 nary trees - heap & game trees
- CS241 Lecture 19, 4/6 nary trees - game trees
- CS241 Lecture 18, 4/4 Implemetations - Radix and Tree sort
- CS241 Lecture 17, 3/23 n log n or n^2? - What could go wrong? Heap, and heap sort
- CS241 Lecture 16, 3/21 n log n & n? - Radix sort, tree sort
- CS241 Lecture 15, 3/16 Onward - Details of merge sort, counting sort
- CS241 Lecture 14, 3/14 Midterm feedback - onward! Details of quick and merge sort
- CS241 Lecture 13, 3/7 Review - design and debugging
- CS241 Lecture 12, 3/2 recursion - merge sort & quick sort
- CS241 Lecture 11, 2/28 Infix to postfix - with parentheses... and GreatBigNumber
- CS241 Lecture 10, 2/23 Expressions - with parentheses... and GreatBigNumber
- CS241 Lecture 9, 2/21 Stacks! - and expressions
- CS241 Lecture 8, 2/16 Bigger life - insertion sort, dynamic programming
- CS241 Lecture 7, Valentine Day Onward! - n^2 sorts
- CS241 Lecture 6, Sausage Day Animation - ...graphical output
- CS241 Lecture 5, 1/30 Timing I - Theta, and Bubblesort
- CS241 Lecture 4, 1/26 Conway - Conway's life and our first sort
- CS241 Lecture 3, 1/24 Intro III - 2D arrays and Conway's life
- CS241 Lecture 2, 1/19 Intro II - Java review/seeding
- CS241 Lecture 1, 1/17 Intro - Introduction/seeding