Insertion sort algorithm

Class : B.Sc (Computer Science ) I year 

topic :Insertion Sort Algorithm 

Faculty : Asst Prof Sonika Mourya 

Insertion Sort Algorithm

Sorting is the process of arranging a list of elements in a particular order (Ascending or Descending).

Insertion sort algorithm arranges a list of elements in a particular order. In insertion sort algorithm, every iteration moves an element from unsorted portion to sorted portion until all the elements are sorted in the list.

Step by Step Process

The insertion sort algorithm is performed using the following steps...

• Step 1 - Assume that first element in the list is in sorted portion and all the remaining elements are in unsorted portion.
• Step 2: Take first element from the unsorted portion and insert that element into the sorted portion in the order specified.
• Step 3: Repeat the above process until all the elements from the unsorted portion are moved into the sorted portion.