From 974a9cfe920b226f98975e7e3483026a59cc3f19 Mon Sep 17 00:00:00 2001 From: Anieshar1 <114723048+Anieshar1@users.noreply.github.com> Date: Tue, 25 Oct 2022 11:10:30 +0530 Subject: [PATCH] Create inserationSort.cpp --- Sorting/Cpp/inserationSort.cpp | 49 ++++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 Sorting/Cpp/inserationSort.cpp diff --git a/Sorting/Cpp/inserationSort.cpp b/Sorting/Cpp/inserationSort.cpp new file mode 100644 index 0000000..ee78fd2 --- /dev/null +++ b/Sorting/Cpp/inserationSort.cpp @@ -0,0 +1,49 @@ +// C++ program for insertion sort + +#include +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; +}