Data Structure Slip No_10B

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

 

void insertionSort(int arr[], int n)

{

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

    {

        int key = arr[i], 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];

    srand(time(0));

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

arr[i] = rand() % 100;

 

    printf("Generated array:\n");

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

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

    printf("\n");

 

    insertionSort(arr, n);

 

    printf("Sorted array:\n");

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

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

    printf("\n");

 }