Insertion Sort appeared in the exercises following Chap. 4. While it can be implemented in a variety of ways, the general step assumes that A[1]... A[k −1] are in non-decreasing order, and now we must...

Insertion Sort appeared in the exercises following Chap. 4. While it can be implemented in a variety of ways, the general step assumes that A[1]... A[k −1] are in non-decreasing order, and now we must “insert” Q ¼ A[k] into its correct position among the previous entries.

Chapter 11