These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....

akshay

• Aug 25th, 2011

BUBBLE SORT:

Code
BUBBLE SORT:
#include<iostream.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
void main()
{
        int a[10],n,temp;
        cout<<"Enter number of elements:";
        cin>>n;
        cout<<"Enter no's: "<<endl;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        cout<<"Sorted list is:";
        for(int m=0;m<n-1;m++)
        {
                for(int p=m+1;p<n;p++)
                {
                        if(a[p]<a[m])
                        {
                          temp=a[p];
                          a[p]=a[m];
                          a[m]=temp;
                        }
 
                }
 
 
        }
        for(int x=0;x<n;x++)
        {
                cout<<a[x]<<endl;
        }
 
}
 

vinod148

 Profile Answers by vinod148 Questions by vinod148

• Oct 23rd, 2009

HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave

Answer Question  Select Best Answer