insertion_sort.c
sorting Implementation
38 lines688 bytesC
1// Insertion Sort
2#include <stdio.h>
3
4void insertionSort(int arr[], int n) {
5 for (int i = 1; i < n; i++) {
6 int key = arr[i];
7 int j = i - 1;
8
9 while (j >= 0 && arr[j] > key) {
10 arr[j + 1] = arr[j];
11 j--;
12 }
13 arr[j + 1] = key;
14 }
15}
16
17void display(int arr[], int n) {
18 for (int i = 0; i < n; i++) {
19 printf("%d ", arr[i]);
20 }
21 printf("\n");
22}
23
24int main() {
25 int arr[] = {12, 11, 13, 5, 6};
26 int n = sizeof(arr) / sizeof(arr[0]);
27
28 printf("Original array: ");
29 display(arr, n);
30
31 insertionSort(arr, n);
32
33 printf("Sorted array: ");
34 display(arr, n);
35
36 return 0;
37}
38