Data-Structures-Algorithms/Sorting/Insertion_Sort.cpp at master · pratik-a/Data-Structures-Algorithms · GitHub

History

47 lines (38 loc) · 881 Bytes

Raw

#include <iostream>

#include <math.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 ot print an array of size n

void printArray(int arr[], int n)

{

int i;

for (i=0; i < n; i++)

cout<<arr[i]<<endl;

}

/* Driver program to test insertion sort */

int main()

{

int arr[] = {12, 11, 13, 5, 6};

int n = sizeof(arr)/sizeof(arr[0]);

insertionSort(arr, n);

printArray(arr, n);

return 0;

}

Data-Structures-Algorithms/Sorting/Insertion_Sort.cpp at master · pratik-a/Data-Structures-Algorithms · GitHub

Expand file tree

Breadcrumbs

Insertion_Sort.cpp

Latest commit

History

Breadcrumbs

Insertion_Sort.cpp

File metadata and controls