Data Structure Slip No_8B

 #include <stdio.h>

#include <conio.h>

void insertionSort(int arr[], int n)

{

    for (int i = 1; i < n; i++)

   {

        int key = arr[i];

        int j = i - 1;

 

        while (j >= 0 && arr[j] > key)

       {

            arr[j + 1] = arr[j];

            j--;

        }

        arr[j + 1] = key;

    }

}

 void main()

{

    int n;

    printf("Enter the number of elements: ");

    scanf("%d", &n);

 

    int arr[n];

    printf("Enter %d elements:\n", n);

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

   {

        scanf("%d", &arr[i]);

    }

    insertionSort(arr, n);

 

    printf("Sorted elements in ascending order:\n");

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

   {

        printf("%d ", arr[i]);

    }

    printf("\n");

}