Insertion,Selection , Bubble shorts , Qucik and Merge sort in one code

  // write a program in c to implement Insertion sort
  // Selection Sort , Bubble sort and Qucik sort
  #include <stdio.h>
  void quicksort(int a[25], int first, int last)
  {
    int i, j, mid, temp;

    if (first < last)
    {
        mid = first;
        i = first;
        j = last;

        while (i < j)
        {
            while (a[i] <= a[mid] && i < last)
                i++;
            while (a[j] > a[mid])
                j--;
            if (i < j)
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }

        temp = a[mid];
        a[mid] = a[j];
        a[j] = temp;
        quicksort(a, first, j - 1);
        quicksort(a, j + 1, last);
    }
  }
  void printArray(int *A, int n)
  {
    for (int i = 0; i < n; i++)
    {
        printf("%d  ", A[i]);
    }
    printf("\n");
  }

  void merge(int A[], int mid, int low, int high)
  {
    int i, j, k, B[100];
    i = low;
    j = mid + 1;
    k = low;

    while (i <= mid && j <= high)
    {
        if (A[i] < A[j])
        {
            B[k] = A[i];
            i++;
            k++;
        }
        else
        {
            B[k] = A[j];
            j++;
            k++;
        }
    }
    while (i <= mid)
    {
        B[k] = A[i];
        k++;
        i++;
    }
    while (j <= high)
    {
        B[k] = A[j];
        k++;
        j++;
    }
    for (int i = low; i <= high; i++)
    {
        A[i] = B[i];
    }
    
  }

  void mergeSort(int A[], int low, int high)
  {
    int mid; 
    if(low<high)
    {
        mid = (low + high) /2;
        mergeSort(A, low, mid);
        mergeSort(A, mid+1, high);
        merge(A, mid, low, high);
    }
  }
  int main()
  {
    int i, j, num, a[100], n;
    printf("Enter the size of elements:-\n ");
    scanf("%d", &num);

    printf("Enter %d element:-\n ", num);
    for (i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }
    printf("Choose one option on of these Sorts\n");
    printf("1. Insertion Sort\n");
    printf("2. Selection Sort\n");
    printf("3. Bubbler Sort\n");
    printf("4. Quick sort\n");
    printf("5. Merge sort\n");
    scanf("%d", &n);
    switch (n)
    {
        int temp;
    case 1:
        for (i = 1; i < num; i++)
        {
            temp = a[i];
            j = i - 1;
            while ((temp < a[j]) && (j >= 0))
            {
                a[j + 1] = a[j];
                j = j - 1;
            }
            a[j + 1] = temp;
        }
        printf("elements: ");
        for (i = 0; i < num; i++)
        {
            printf(" %d ", a[i]);
        }
        break;

        int swap, position;
    case 2:
        for (i = 0; i < num - 1; i++)
        {
            position = i;
            for (j = i + 1; j < num; j++)
            {
                if (a[position] > a[j])
                    position = j;
            }
            if (position != i)
            {
                swap = a[i];
                a[i] = a[position];
                a[position] = swap;
            }
        }
        printf("Sorted elements: ");
        for (i = 0; i < num; i++)
            printf(" %d ", a[i]);
        break;

    case 3:

        //This is the main logic of bubble sort algorithm
            for (i = num - 2; i >= 0; i--)
        {
            for (j = 0; j <= i; j++)
            {
                if (a[j] > a[j + 1])
                {
                    temp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = temp;
                }
            }
        }
        printf("Sorted list in Ascending order:\n");
        for (i = 0; i < num; i++)
        {
            printf(" %d", a[i]);
        }
        break;
    case 4:
        quicksort(a, 0, num - 1);

        printf("Your Sorted elements is : ");
        for (i = 0; i < num; i++)
        {
            printf(" %d ", a[i]);
        }
        break;
    case 5:
    printf("your Array : ");
    printArray(a, n);
    mergeSort(a, 0, 6);
    printf("Sorted Array is : ");
    printArray(a, n);
        break;
    default:
    {
        printf("You have entered wrong key!");
        break;
    }
        return 0;
    }
  } 

When the above program is executed, it produces following results --<\b>
OUTPUT :- 01
INSERTION SORT

  Enter the size of elements:-
    5
   Enter 5 element:-
   44
   3
  -1
   90
   7
   Choose one option on of these
   1. Insertion Sort
   2. Selection Sort
   3. Bubbler Sort
   4. Quick Sort
   5. Merge Sort
   1
   Sorted elements:  -1  3  7  44  90

OUTPUT :- 02
SELECTION SORT

  Enter the size of elements:-
   6
  Enter 6 element:-
   33
   120
   18
   -2
   15
   1
  Choose one option on of these
  1. Insertion Sort
  2. Selection Sort
  3. Bubbler Sort
  4. Quick Sort
  5. Merge Sort
  2
  Sorted elements:  -2  1  15  18  33  120 

OUTPUT :- 03
BUBBLE SORT

   Enter the size of elements:-
   7
   Enter 7 element:-
  58
  20
  -5
  255
  
  Choose one option on of these
  1. Insertion Sort
  2. Selection Sort
  3. Bubbler Sort
  4. Quick Sort
  5. Merge Sort
  3
  Sorted elements:  -5  20  58  255

OUTPUT :- 04
Quick SORT

  Enter the size of elements:-
  5
  Enter 5 element:-
   12
  390
  -6
  2
  15
  Choose one option on of these
  1. Insertion Sort
  2. Selection Sort
  3. Bubbler Sort
  4. Quick sort
  5. Merge Sort
  4
  Your Sorted elements is :  -6  2  12  15  390 

OUTPUT :- 05
MERGE SORT

   Enter the size of elements:-
    6
   Enter 6 element:-
    240
   -5
   27
   19
   90
   11
   Choose one option on of these Sorts
   1. Insertion Sort
   2. Selection Sort
   3. Bubbler Sort
   4. Quick Sort
   5. Merge Sort
   5
   your Array : 240  -5  27  19  90  
   Sorted Array is : -5  1  11  19  27