Chapter 9, Problem 8SA

Program Plan Intro

Insertion sort algorithm

• Sorting is a process to place the elements in order.
• Insertion sort is used to sort the group of data.
• The unsorted elements are placed in the array.
• In each iteration, the element is compared with the next one; if the element is greater than the next one, then the next element is inserted before the current element and the current element is moved to the next position.
• In each iteration, the element is inserted in its appropriate place.
• The insertion process may place one or more elements in its permanent position.