This chapter examines three different sorts. The first is one of the simpler ones, the insertion sort. The second is one of the fastest sorts, the quick sort. The third is called the radix (or bucket) sort and can be used for sorting physical items, but can also be adapted to sort items in memory as well. Al three sorts are illustrated using diagrams and include an elementary analysis of the algorithms. The complete program uses the quick sort to sort string items.