Scribd Logo
Upload

Welcome to Scribd!

  • Program 2

    Uploaded by

    HACKER SPACE
    9 views4 pages
    The document defines functions to test the best case, worst case, and average case time complexities of a bubble sort algorithm. It initializes an array of 5000 random or sorted integers. It then performs a bubble sort on the array and uses clock() to measure the time taken. This time is printed along with a label of the case being tested. The main function prompts the user to choose which case to run and calls the corresponding function.

    Original Description:

    DAA PROGRAM

    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 defines functions to test the best case, worst case, and average case time complexities of a bubble sort algorithm. It initializes an array of 5000 random or sorted integers. It then performs a bubble sort on the array and uses clock() to measure the time taken. This time is printed along with a label of the case being tested. The main function prompts the user to choose which case to run and calls the corresponding function.

    Copyright:

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

    Program 2

    Uploaded by

    HACKER SPACE
    The document defines functions to test the best case, worst case, and average case time complexities of a bubble sort algorithm. It initializes an array of 5000 random or sorted integers. It then performs a bubble sort on the array and uses clock() to measure the time taken. This time is printed along with a label of the case being tested. The main function prompts the user to choose which case to run and calls the corresponding function.

    Copyright:

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

    Program 2

    #include<stdio.h>

    #include<time.h>

    int temp,i,j,a[5000];

    clock_t end,start;

    double casee;

    void bestcase()

    for(i=0;i<=5000;i++)

    a[i]=i;

    start=clock();

    for(i=1;i<5000;i++)

    for(j=5000;j>=i+1;j--)

    if(a[j]<a[j-1])

    { temp=a[j];

    a[j]=a[j-1];

    a[j-1]=temp;

    end=clock();

    casee=(double)(end-start)/CLOCKS_PER_SEC;

    printf("\n time complexity for best case is :%f \n ",casee);


    }

    void worstcase()

    for(i=0;i<5000;i++)

    a[i]=5000-i;

    start=clock();

    for(i=1;i<5000;i++)

    for(j=5000;j>=i+1;j--)

    if(a[j]<a[j-1])

    { temp=a[j];

    a[j]=a[j-1];

    a[j-1]=temp;

    end=clock();

    casee=(double)(end-start)/CLOCKS_PER_SEC;

    printf("\n time complexity for worst case is :%f \n ",casee);

    void averagecase()

    for(i=0;i<5000;i++)

    {
    a[i]=rand()%5000;

    start=clock();

    for(i=1;i<5000;i++)

    for(j=5000;j>=i+1;j--)

    if(a[j]<a[j-1])

    { temp=a[j];

    a[j]=a[j-1];

    a[j-1]=temp;

    end=clock();

    casee=(double)(end-start)/CLOCKS_PER_SEC;

    printf("\n time complexity for average case is :%f \n ",casee);

    void main()

    int s;

    printf("1 for best case\n 2 for average case\n 3 for worst case\n");

    do

    printf("enter choice : ");

    scanf("%d",&s);

    switch(s)
    {

    case 1:

    bestcase();

    break;

    case 2:

    averagecase();

    break;

    case 3:

    worstcase();

    break;

    case 4:

    break;

    default:

    printf("enter correct choice pls");

    break;

    }while(s!=4);

    //return 0;

    You might also like