Sorting (5)

Michael L. Littman

September 16th, 1997

• SORTING
  • Telephone Book Publishing
  • Data Details
  • Comparing Keys
  • Formal Statement [Step 0]
  • Permutations
  • Beyond Adjacency
  • Keys
  • Sorts of Sorts
  • Other Applications
• BUBBLESORT
  • Arrays
  • Step 1: Develop Algorithm
  • Explanation
  • Step 2: Prove Correctness
  • Measures of Sortedness
  • Improvements in Bubblesort
  • Step 3: Analyze Running Time
  • An Assortment of Sorts
• DIVIDE-AND-CONQUER SORTING
  • Recurrences for Earlier Sorts
  • Divide and Conquer
  • Two Algorithms
  • Merge Sort
  • Quicksort
  • Partitioning In Place
  • Explanation
  • Picking A Pivot
  • A Consortium
• HOMEWORK
  • Homework 1
  • Homework 2
  • Sparse Matrices
  • Homework 3