Scribd Logo
Upload

Welcome to Scribd!

  • O",Rstrlqtqryeg: T..R R,.R Utt1Qrt1) ,: Disp (Arr1), Create (Anz)

    Uploaded by

    Suraj Jadhav
    7 views1 page
    The document discusses sorting arrays in C programming. It presents code to: 1) Create two arrays and prompt the user to select an option for the arrays 2) Display the initial and sorted arrays after different sorting algorithms are applied, including bubble sort 3) Merge two previously sorted arrays into a new sorted array

    Original Description:

    this is 2nd page of practical no. 1b

    Original Title

    IMG_0005

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses sorting arrays in C programming. It presents code to: 1) Create two arrays and prompt the user to select an option for the arrays 2) Display the initial and sorted arrays after different sorting algorithms are applied, including bubble sort 3) Merge two previously sorted arrays into a new sorted array

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views1 page

    O",Rstrlqtqryeg: T..R R,.R Utt1Qrt1) ,: Disp (Arr1), Create (Anz)

    Uploaded by

    Suraj Jadhav
    The document discusses sorting arrays in C programming. It presents code to: 1) Create two arrays and prompt the user to select an option for the arrays 2) Display the initial and sorted arrays after different sorting algorithms are applied, including bubble sort 3) Merge two previously sorted arrays into a new sorted array

    Copyright:

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

    a

    ilrd
    ffi o",rstrlqtqryEg
    pri@tntei Your choice");
    ,.unf (i god', achoice);

    Data t..r*r,.r*utt1qrt1);
    , '
    Khus : printf("The xst araY is:');
    D.]. S
    Swan disP(arr1); , ,

    Cheta
    : case 2 : create(anZ); '
    Resea

    > Coml : disP(an2);


    J.S.l
    case 3: bubbteSort(an1); :

    > Datal ,' printt("The gsrted 1st array is:");


    Pank disP(anl); l

    Phoer hreak;l
    Smru cise 4: bubbl'eSort(arr2);
    2nd inaY is:");
    SVKM Printf('The tottta
    Mana disP(arr2);

    ease 6:
    printf('lThe mergeei sorted array
    is");

    break;
    case z: break

    iwtiiteqinoice!;7);

    ' ,n,,*,
    white(temP[i]l='\O')
    {

    .ru..uUnt temP[]) ,

    ) Krisl
    Tel No
    fo,o
    t it,a"
    Tel. N, Il#iir"ter number of erernents");

    > Bh;," sianf('l$od", &n);,


    Tel. N' ior(i*0;i.n;i+i) ,

    ) viany
    Tel. N

    You might also like