Visual Sort

Insertion Sort

Speed

Number of Elements

[Range: 10-100]

Implementations

          
            void insertionSort(int array[], int n){
              int j;
              int k;

              for (int i = 0; i < n; i++){
                k = array[i];
                j = i - 1;

                while (j >= 0 && array[j] > k){
                  array[j + 1] - array[j];
                  j--;
                }

                array[j + 1] = k;
              }
            }

          
            def insertionSort(array):
              for i in range(1, len(array)):

                k = array[i]
                j = i - 1

                while j >= 0 and k < array[j]:
                  array[j + 1] - array[j]
                  j = j - 1
                
                array[j + 1] = k

          
            function insertionSort(array){
              var n = array.length;
              let j, k;
              for (let i = 0; i < n; i++){
                k = array[i];
                j = i - 1;

                while (j >= 0 && array[j] > k){
                  array[j+1] = array[j];
                  j--;
                }

                array[j+1] = k;
              }
            }

About Insertion Sort

The Insertion sorting method is very simple. The input array is split into two- one sorted section and one unsorted section. The sort will look for the next value in the unsorted section and insert it into the correct index in the sorted section.

Time Complexity

The Insertion sorting method has a time complexity of: O(N²)