Thursday, 12/2/99

• character/string as multidimensional arrays: palindrome.c
• introduction to sorting
  • advantage of sorted data
  • data structure and sorting: array, (and list, tree, etc.)
  • ideas about sorting:
    • insertion sort idea for hw#12,
    • selection sort
    • other sorting algorithms: bubble, quick, etc.
  • efficiency: time and space
  • selection sort example in "sort.c" (Fig. 12-5, pp.443-444)
• searching of sorted data and homework#12:
  • one-by-one comparison: search keyword list
    - similar to FindIntegerInArray() (in findcoin.c, ch.12)
  • sorted data: binary search idea
  • hw#12 partial solution: particularly IsKeywordB() in
  • validB.c
  • efficiency O(log(n)) instead of O(n)
  • binary trees and B-trees, and indexing hierarchies/files
• review for final
  • topics covered: on-line list
  • general info: see final exam information
  • major topics/programming:
    1. arrays
    2. strings,
    3. searching/sorting
  • other things: multiple choice and short answer
  • office hours for the next week:
    - open office
    - early afternoons best time to see me

Saturday, 12/11/99

• 9-11am, final exam: See online information