Typo in 5.12. The Quick Sort

[yay-jake]

The idea is that in the case where the the first item in the list does not belong toward the middle of the list, the median of three will choose a better “middle” value.

http://interactivepython.org/courselib/static/pythonds/SortSearch/TheQuickSort.html