Insertion sort

def insertionSort(arr): 
    for i in range(1, len(arr)): 
        key = arr[i] 
        j = i-1
        while j >= 0 and key < arr[j] : 
                arr[j + 1] = arr[j] 
                j -= 1
        arr[j + 1] = key

Insertion sort

// C++ program for insertion sort 
#include <bits/stdc++.h>
using namespace std;

/* Function to sort an array using insertion sort*/
void insertionSort(int arr[], int n) 
{ 
    int i, key, j; 
    for (i = 1; i < n; i++)
    { 
        key = arr[i]; 
        j = i - 1; 

        /* Move elements of arr[0..i-1], that are 
        greater than key, to one position ahead 
        of their current position */
        while (j >= 0 && arr[j] > key)
        { 
            arr[j + 1] = arr[j]; 
            j = j - 1; 
        } 
        arr[j + 1] = key; 
    } 
} 

// A utility function to print an array of size n 
void printArray(int arr[], int n) 
{ 
    int i; 
    for (i = 0; i < n; i++) 
        cout << arr[i] << " "; 
    cout << endl;
} 

/* Driver code */
int main() 
{ 
    int arr[] = { 12, 11, 13, 5, 6 }; 
    int n = sizeof(arr) / sizeof(arr[0]); 

    insertionSort(arr, n); 
    printArray(arr, n); 

    return 0; 
} 

// This is code is contributed by rathbhupendra

Source: geeksforgeeks.org

Insertion sort

#include <bits/stdc++.h>

using namespace std; 

void insertionSort(int arr[], int n)  
{  
    int i, temp, j;  
    for (i = 1; i < n; i++) 
    {  
        temp = arr[i];  
        j = i - 1;  

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

int main()  
{  
    int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };  
    int n = sizeof(arr) / sizeof(arr[0]);  

    insertionSort(arr, n);  

    for(int i = 0; i < n; i++){
        cout << arr[i] << " ";
    }

    return 0;  
}

Insertion sort

 function insertionSortIterativo(array A)
     for i ← 1 to length[A] 
       do value ← A[i]
            j ← i-1
        while j >= 0 and A[j] > value 
          do A[j + 1] ← A[j]
             j ← j-1
        A[j+1] ← value;

Source: it.wikipedia.org

Insertion sort

*** Insertion sort ***
Enter some numbers : 1 2 3 4

[1, 2, 3, 4]
Data comparison =  3

Source: datastruc.ce.kmitl.ac.th

Insertion sort

 function insertionSortRicorsivo(array A, int n)
     if n>1
        insertionSortRicorsivo(A,n-1)
        value ← A[n-1]
        j ← n-2
        while j >= 0 and A[j] > value 
         do A[j + 1] ← A[j]
            j ← j-1
        A[j+1] ← value

Source: it.wikipedia.org

Similar codes

0 vote302 views1 answer
C++ foreach vector
C++
1 vote353 views1 answer
C++ return value of set insert
C++
0 vote282 views1 answer
TCA9548 I2CScanner Arduino
C++
5 votes293 views1 answer
Screen record ios simulator
C++
0 vote295 views1 answer
16630147
C++
0 vote286 views1 answer
How to remove the % in zsh that show after running c++ file
C++
0 vote298 views3 answers
C++ tuple
C++
2 votes317 views2 answers
Array and for loop in c++
C++
5 votes273 views3 answers
Int to float c++
C++
0 vote295 views1 answer
String reverse iterator c++
C++