Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Exp 1 AA

    Uploaded by

    राजस करंदीकर
    The document discusses merge sort, an efficient sorting algorithm based on the divide and conquer approach. It explains how merge sort works by recursively dividing an array into halves and then merging the sorted halves, outlines pseudocode for the merge sort algorithm, and provides an example C implementation to sort an integer array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Exp 1 AA

    Uploaded by

    राजस करंदीकर
    9 views4 pages
    The document discusses merge sort, an efficient sorting algorithm based on the divide and conquer approach. It explains how merge sort works by recursively dividing an array into halves and then merging the sorted halves, outlines pseudocode for the merge sort algorithm, and provides an example C implementation to sort an integer array.

    Original Title

    Exp1AA

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses merge sort, an efficient sorting algorithm based on the divide and conquer approach. It explains how merge sort works by recursively dividing an array into halves and then merging the sorted halves, outlines pseudocode for the merge sort algorithm, and provides an example C implementation to sort an integer array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    9 views4 pages

    Exp 1 AA

    Uploaded by

    राजस करंदीकर
    The document discusses merge sort, an efficient sorting algorithm based on the divide and conquer approach. It explains how merge sort works by recursively dividing an array into halves and then merging the sorted halves, outlines pseudocode for the merge sort algorithm, and provides an example C implementation to sort an integer array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Experiment No.

    Aim: Implementation of Merge sort using divide and conquer approach.

    Required Software/ Software Tool:


    - Windows Operating System
    -C/C++/JAVA

    Theory:
    Merge sort is a sorting technique based on divide and conquer technique. With worst-case time
    complexity being Ο (n log n), it is one of the most respected algorithms. Merge sort first divides
    the array into equal halves and then combines them in a sorted manner.

    How Merge Sort Works?


    To understand merge sort, we take an unsorted array as the following −

    We know that merge sort first divides the whole array iteratively into equal halves unless
    the atomic values are achieved. We see here that an array of 8 items is divided into two
    arrays of size 4.

    This does not change the sequence of appearance of items in the original. Now we
    divide these two arrays into halves.

    We further divide these arrays and we achieve atomic value which can no more be
    divided.

    Now, we combine them in exactly the same manner as they were broken down. Please
    note the color codes given to these lists.

    We first compare the element for each list and then combine them into another list in a
    sorted manner. We see that 14 and 33 are in sorted positions. We compare 27 and 10
    and in the target list of 2 values we put 10 first, followed by 27. We change the order of
    19 and 35 whereas 42 and 44 are placed sequentially.

    In the next iteration of the combining phase, we compare lists of two data values, and
    merge them into a list of found data values placing all in a sorted order.

    After the final merging, the list should look like this −

    Now we should learn some programming aspects of merge sorting.

    Algorithm:
    Merge sort keeps on dividing the list into equal halves until it can no longer be divided.
    By definition, If it is only one element in the list, it is sorted. Then, merge sort combines
    the smaller sorted lists keeping the new list sorted too.
    Step 1 − If it is only one element in the list it is already sorted, return.
    Step 2 − divide the list recursively into two halves until it can no more be
    divided.
    Step 3 − merge the smaller lists into new list in sorted order.

    Implementing the Solution Writing Source Code:


    #include <stdio.h>
    // Rajas Karandikar
    void merge(int arr[], int l, int m, int r) {
    int i, j, k;
    int n1 = m - l + 1;
    int n2 = r - m;
    int L[n1], R[n2];
    for (i = 0; i < n1; i++)
    L[i] = arr[l + i];
    for (j = 0; j < n2; j++)
    R[j] = arr[m + 1 + j];
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
    arr[k] = L[i];
    i++;
    } else {
    arr[k] = R[j];
    j++;
    }
    k++;
    }
    while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
    }
    while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
    }
    }
    void mergeSort(int arr[], int l, int r) {
    if (l < r) {
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
    }
    }
    void printArray(int A[], int size) {
    int i;
    for (i = 0; i < size; i++)
    printf("%d ", A[i]);
    printf("\n");
    }
    int main() {
    int arr[] = {12, 11, 13, 5, 6, 7};
    int arr_size = sizeof(arr) / sizeof(arr[0]);
    printf("Given array is \n");
    printArray(arr, arr_size);
    mergeSort(arr, 0, arr_size - 1);
    printf("\nSorted array is \n");
    printArray(arr, arr_size);
    return 0;
    }
    Input and Output:

    Conclusion: Hence we implemented Merge sort using divide and conquer


    approach in C

    You might also like