forked from sherigar/HacktoberFest-2023
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[Fix]: issue sherigar#156 Insertion Sort Algorithm in C language
- Loading branch information
1 parent
ea21ab5
commit fd94b29
Showing
1 changed file
with
42 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,42 @@ | ||
// C program for insertion sort | ||
#include <math.h> | ||
#include <stdio.h> | ||
|
||
/* 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++) | ||
printf("%d ", arr[i]); | ||
printf("\n"); | ||
} | ||
|
||
/* 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; | ||
} |