Answers for "insertion sorting"

insertion sort

#insertion sort
def insert(arr):
    for i in range(1,len(arr)):
        while arr[i-1] > arr[i] and i > 0:
            arr[i], arr[i-1] = arr[i-1], arr[i]
            i -= 1 
    return arr 
arr = [23, 55, 12, 99, 66, 33]
print(insert(arr))

program for insertion sort

# another method similar to insertion sort

def insertionSort(arr):
    for i in range(1, len(arr)):
        k = i
        for j in range(i-1, -1, -1):
            if arr[k] < arr[j]:  # if the key element is smaller than elements before it
                temp = arr[k]  # swapping the two numbers
                arr[k] = arr[j]
                arr[j] = temp

                k = j  # assigning the current index of key value to k
        

arr = [5, 2, 9, 1, 10, 19, 12, 11, 18, 13, 23, 20, 27, 28, 24, -2]

print("original array \n", arr)
insertionSort(arr)
print("\nSorted array \n", arr)

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

#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

// Por ter uma complexidade alta,
// não é recomendado para um conjunto de dados muito grande.
// Complexidade: O(n²) / O(n**2) / O(n^2)
// @see https://www.youtube.com/watch?v=TZRWRjq2CAg
// @see https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html

function insertionSort(vetor) {
    let current;
    for (let i = 1; i < vetor.length; i += 1) {
        let j = i - 1;
        current = vetor[i];
        while (j >= 0 && current < vetor[j]) {
            vetor[j + 1] = vetor[j];
            j--;
        }
        vetor[j + 1] = current;
    }
    return vetor;
}

insertionSort([1, 2, 5, 8, 3, 4])

insertion sorting

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class InsertionSorting {
    public static Scanner scanner = new Scanner(System.in);
    public static void main(String[] argh){
    int[] arrNotSorted = newArrInitilizer();
    enterValues(arrNotSorted);
    sortArray(arrNotSorted);
    print(arrNotSorted);

    }
  	//Print Array
    public static void print(int[] arr){
            System.out.print(Arrays.toString(arr));
    }
  
	/* looping from "i"(the incremented index in) ==> function
    public static int[] sortArray(int [] unsortedArr)
   	first we initilize an integer "value"= Array[from])
    this will be assigned later to the Array in the minmum value index 
    
    and while (from > 0) && (Array[from-1] > value) 
    we assign every next value to the previous one 
    
     eventually we decrement ("from")
   */
    public static void insertionSorting(int [] toBesorted, int from){
        int value = toBesorted[from];
        while(from > 0 && toBesorted[from-1] > value){
            toBesorted[from] = toBesorted[from-1];
         --from;
        }

        toBesorted[from] = value;

    }
 	
	/* Looping from index = 1, array with size one concidered sorted) 
    later "From" will be assigned to i in the function above */
    public static int[] sortArray(int [] unsortedArr){
        for(int i = 1 ; i < unsortedArr.length ; ++i){
            insertionSorting(unsortedArr,i);
        }

        return unsortedArr;
    }

  
  
    public static int[] newArrInitilizer() {
        System.out.println("Enter Array Size .");
        int arrSize = scanner.nextInt();
        int[] arr = new int[arrSize];
        return arr;
    }
		
  
  
    public static int [] enterValues(int[] arr){
        System.out.println("Array being initlized randomly with "+arr.length+" values.");
        for(int i = 0 ; i< arr.length ; ++i){
            arr[i] = (int) (Math.random()*10);
        }
        return  arr;
    }
}