Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Merge Sort

    Uploaded by

    Sushree sangita Barik
    This program implements merge sort, a sorting algorithm that divides an array into halves, recursively sorts them, and then merges the sorted halves into a single sorted array. It includes functions to recursively split the array, sort the halves using merge sort, and merge the sorted halves back together. The main function takes input from the user, calls mergeSort to initially sort the array, and then prints out the sorted output.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Merge Sort

    Uploaded by

    Sushree sangita Barik
    3 views4 pages
    This program implements merge sort, a sorting algorithm that divides an array into halves, recursively sorts them, and then merges the sorted halves into a single sorted array. It includes functions to recursively split the array, sort the halves using merge sort, and merge the sorted halves back together. The main function takes input from the user, calls mergeSort to initially sort the array, and then prints out the sorted output.

    Original Description:

    Merge sort

    Original Title

    MergeSort

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This program implements merge sort, a sorting algorithm that divides an array into halves, recursively sorts them, and then merges the sorted halves into a single sorted array. It includes functions to recursively split the array, sort the halves using merge sort, and merge the sorted halves back together. The main function takes input from the user, calls mergeSort to initially sort the array, and then prints out the sorted output.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    3 views4 pages

    Merge Sort

    Uploaded by

    Sushree sangita Barik
    This program implements merge sort, a sorting algorithm that divides an array into halves, recursively sorts them, and then merges the sorted halves into a single sorted array. It includes functions to recursively split the array, sort the halves using merge sort, and merge the sorted halves back together. The main function takes input from the user, calls mergeSort to initially sort the array, and then prints out the sorted output.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 4

    Merge Sort

    Program
    #include<stdio.h>
    #include<conio.h>
    void merge(int arr[],int l,int mid,int r);
    void mergeSort(int arr[],int l,int r);
    void main()
    {
        int a[25],n,i;
        printf("Enter the number of elements\n");
        scanf("%d",&n);
        printf("Enter the array elements\n");
         for(i=0;i<n;i++)
         {
             scanf("%d",&a[i]);
         }
        mergeSort(a,0,n-1);
        printf("Sorted array is:\n");
          for(i=0;i<n;i++)
          {
             printf("%d\n",a[i]);
          }
         getch();
    }

    void merge(int arr[],int l,int mid,int r)
    {
        int n1=mid-l+1;
        int n2=r-mid;
        int i,j,k;
        int a[n1];
        int b[n2];
        for(i=0;i<n1;i++)
         {
             a[i]=arr[l+i];
         }
         for(i=0;i<n2;i++)
         {
             b[i]=arr[mid+1+i];
         }
         i=0;
         j=0;
         k=l;
        while(i<n1 && j<n2)
        {
            if(a[i]<b[j])
            {
                arr[k]=a[i];
                k++;
                i++;
            }
            else
            {
                arr[k]=b[j];
                k++;
                j++;
            }
        }
        while(i<n1)
         {
                arr[k]=a[i];
                k++;
                i++;
         }
         while(j<n2)
          {
                arr[k]=b[j];
                k++;
                j++;
        }
    }
    void mergeSort(int arr[],int l,int r)
    {
        int mid;
        if(l<r)
        {
            mid=(l+r)/2;
            mergeSort(arr,l,mid);
            mergeSort(arr,mid+1,r);
            merge(arr,l,mid,r);
        }
    }
    Output

    You might also like