Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    ADSA 2nd Assess

    Uploaded by

    vivekkrpandit134

    Copyright:

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

    ADSA 2nd Assess

    Uploaded by

    vivekkrpandit134
    3 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    ADSA 2nd Assess

    Uploaded by

    vivekkrpandit134

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    DEPARTMENT OF

    COMPUTER SCIENCE & ENGINEERING

    Experiment 1.2
    Student Name: Vivek Kumar UID: 23BCS1318
    Branch: BE-CSE Section/Group: 605-A
    rd
    Semester: 3 Sem Date of Performance: 09-09-2024
    Subject Name: Adv. Data Structure & Algorithm Subject Code: 23CSH-204

    1. Aim: You are creating an innovative method to effectively sort a huge dataset.
    The program separates the dataset into smaller chunks, handles each chunk
    separately and then aggregates the output. But this algorithm performance is
    essential to its success.

    2. Hint: Huge Dataset.


    Algorithm performance is essential to its success.

    3. Requirements(Hardware/Software):
     C++ compiler.

    4. Procedure:
    #include<iostream>

    using namespace std;

    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 arr[], int n) {

    int i;

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

    cout << arr[i] << " ";

    cout << endl;

    int main(){

    int n;

    cout << "Enter the size of array: ";

    cin >> n;

    int arr[n];

    cout << "Enter the elements for the array: ";

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

    cin >> arr[i];

    cout << endl;


    cout << "Entered array: ";

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

    cout << arr[i] << " ";

    mergeSort(arr, 0, n - 1);

    cout << "\nSorted array is: ";

    printArray(arr, n);

    return 0;

    5. Output:

    6. Learning Outcome:
     Learnt how to use of functions.
     Learnt how to call a function in the main function.
     Learnt the Merge sort algorithm.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy