Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Bubble Sort and Optimized Bubblesort

    Uploaded by

    Rwthhw Rrkurme
    The document describes the bubble sort algorithm and an optimized version. It defines a bubble_sort class with methods to get input, sort an array, and output the results. The sort method compares adjacent elements and swaps them if out of order. The optimized version adds a test variable to check if any swaps occurred, and returns early without additional passes if the array is already sorted.

    Copyright:

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

    You might also like

    Bubble Sort and Optimized Bubblesort

    Uploaded by

    Rwthhw Rrkurme
    12 views4 pages
    The document describes the bubble sort algorithm and an optimized version. It defines a bubble_sort class with methods to get input, sort an array, and output the results. The sort method compares adjacent elements and swaps them if out of order. The optimized version adds a test variable to check if any swaps occurred, and returns early without additional passes if the array is already sorted.

    Original Description:

    Turbo c

    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
    The document describes the bubble sort algorithm and an optimized version. It defines a bubble_sort class with methods to get input, sort an array, and output the results. The sort method compares adjacent elements and swaps them if out of order. The optimized version adds a test variable to check if any swaps occurred, and returns early without additional passes if the array is already sorted.

    Copyright:

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

    Bubble Sort and Optimized Bubblesort

    Uploaded by

    Rwthhw Rrkurme
    The document describes the bubble sort algorithm and an optimized version. It defines a bubble_sort class with methods to get input, sort an array, and output the results. The sort method compares adjacent elements and swaps them if out of order. The optimized version adds a test variable to check if any swaps occurred, and returns early without additional passes if the array is already sorted.

    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

    1.

    Bubble sort :

    #include<iostream.h>

    #include<conio.h>

    class bubble_sort

    int a[20],i,j,n,temp;

    public:

    void get();

    void sort();

    void put();

    };

    void bubble_sort::get()

    cout<<"\n Enter the size of array";

    cin>>n;

    cout<<"\n enter the array element";

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

    cin>>a[i];

    cout<<"\n array elements before sort :\n";

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

    cout<<a[i]<<"\t";

    void bubble_sort::sort()

    for(i=1;i<=n-1;i++)

    {
    for(j=1;j<=n-i;j++)

    if(a[j] > a[j+1])

    temp=a[j];

    a[j]=a[j+1];

    a[j+1]=temp;

    void bubble_sort::put()

    cout<<"\n element after Bubble sorting\n";

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

    cout<<a[i]<<"\t";

    void main()

    clrscr();

    bubble_sort b;

    b.get();

    b.sort();

    b.put();

    getch();

    OutPut:
    2. Bubble sort Optimize:
    #include<iostream.h>
    #include<conio.h>
    class bubble_sort
    {
    int a[20],i,j,n,temp,test;
    public:
    void get();
    void sort();
    void put();
    };
    void bubble_sort::get()
    {
    cout<<"\n Enter the size of array";
    cin>>n;
    cout<<"\n enter the array element";
    for(i=1;i<=n;i++)
    cin>>a[i];
    cout<<"\n -----------------------";
    cout<<"\n array elements before sort :\n";
    for(i=1;i<=n;i++)
    cout<<a[i]<<"\t";
    }
    void bubble_sort::sort()
    {
    for(i=1;i<=n-1;i++)
    {
    test=0;
    for(j=1;j<=n-i;j++)
    {
    if(a[j] > a[j+1])
    {
    temp=a[j];
    a[j]=a[j+1];
    a[j+1]=temp;
    test=1;
    }
    }
    }
    if (test==0)
    return ;
    }

    void bubble_sort::put()
    {
    cout<<"\n element after sorting";
    for(i=1;i<=n;i++)
    cout<<a[i]<<"\t";
    }
    void main()
    {
    clrscr();
    bubble_sort b;
    b.get();
    b.sort();
    b.put();
    getch();
    }

    You might also like