Insert Sorting

Aug 27, 2021

Insert sorting is a simple sorting algorithm that sorts the list one item at a time. The algorithm takes the element and compares the already sorted set. It inserts the element in its appropriate place within sorted elements.

Element sitch method #

info Pseudocode for Insert Sorting algorithm (element shift method)

FOR element in the list s
    SAVE element_i
    SAVE position_i
    FOR element_j in the position_i-1 TO 0
        IF element_i < element_j
            SIFT RIGHT element_j
            DECREMENT position
    SAVE element to position
    
Sorted Array = s

------ Execution ------


Insert Sorting (shift method)
-----------------------------------
list (before): [3 1 4 2]
list (after): [1 2 3 4]

Element copy method #

info Pseudocode for Insert Sorting algorithm (element insert/delete method)

FOR element_i in the list s
    FOR element_j FROM position 0 TO element_i
        IF element_i < element_j
            APPEND a dummy elelent to the end of the list
            SIFT RIGHT element_j
            INSERT element_i TO the position_j
            REMOVE element_i
            BREAK inner loop
    
Sorted Array = s

------ Execution ------


Insert Sorting (element insert/delete method)
---------------------------------------------
array (before): [3 1 4 2]
array (after): [1 2 3 4]