Mar 25: Sorting Project presentations and performance competition.
Relevant files: 320dir/makefile, intSortMain.cc, floatSortMain.cc, stringSortMain.cc.
Mar 23: Continue on Hashing, Chapter 16
Homework #4 due Tues, Apr 6: Chapter 16 Ex 3, 4, 8.
Mar 18: Hashing. Reading: Chapter 16.
HW#3 Due.
Mar 16: Red-Black trees. See 320dir/dictionary/new/dictmain.cc and randmain.cc and rbt.h
See also the demo at
http://wyoming.hcca.ohio.gov/HTML/RedBlack/redblack.html,
brought to my attention by Raj Thakkar.
Quiz#3 on ch 14, 15.
Mar 11: 2-3-4 Trees.
Homework #3 due Thurs, Mar 18: Chapter 14 Ex 4, Chapter 15 Ex 3 and 4.
Project due date postponed to Mar 23.
Mar 9: Generic programming with templates.
Reading: Chapter 16, 2-3-4 Trees.
Mar 2: Searching in arrays: Sequential, Binary, Interpolation
Reading: Chapter 14.
Handout: Paper on introspective sort (used in STL) by David Musser.
Quiz-2. On sorting.
Feb 25: Heap Sort, see
heapSort.cc ,
sorting wrapup.
Reading: Chapter 11.
Homework #2 due Thurs, Mar 4: Chapter 11, Exercises 2, 4, and 8 .
Feb 23:
Mergesort and external sorting.
Guest lecturer:
Foster McGeary
(click to find sample mergesort codes)
Reading: Chapters 12 & 13 .
Feb 18:
Quicksort and not yet Heapsort.
Reading: Chapter 9 & not yet 11.
Quiz-1.
Feb 16:
Elementary sorting algorithms, timings and analysis, use of templates
HW#1 due.
Reading Chapters 8 .
Feb 11:
Tree traversal including level order traversal of forests represended
as binary trees.
Feb 9:
Intro, syllabus handed out, Trees (chapter 4).
Reading: Scan chapters 1-7, read chapters 4 and 6 carefully.
Homework #1 due Tue, Feb 16: Chapter 4, Exercises 4, 7, and 8 .