STRING SORTS STUDY GUIDE


Terminology

Key indexed counting. Allows you to sort N keys that are integers between 0 and R-1 in time proportional to N + R. Beats linearithmic lower bound by avoiding any binary compares. This is a completely different philosophy for how things should be sorted. This is the most important concept for this lecture.

Manually performing LSD and MSD. Should be doable in your sleep.

LSD.

MSD.

3-way String Quicksort.

Suffix sorting.

Recommended Problems

C level

  1. Spring 2012 Final, #6
  2. Fall 2014 Final, #3
  3. Spring 2015 Final, #5

B level

  1. Fall 2008 Final, #6
  2. Fall 2012 Final, #7
  3. Spring 2008 Final, #12
  4. Textbook 5.1.8, 5.1.10

A level

  1. How could we avoid the performance hit from our special charAt() function?
  2. What makes MSD cache unfriendly?