Code Zone: Sorting Algorithms

Sunday, December 11, 2011

Exchange Sorts: Bubble,Quick,Odd-even

Selection: Selection,Heap,Tournament

Insertion: Insertion,Shell,Tree,Patience

Merge: Merge

Distribution: Bucket,Counting,Radix

Useful Links:
http://en.wikipedia.org/wiki/Sorting_algorithm
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Sorting/sortingIntro.htm

10 comments:

SudDecember 28, 2011 at 10:05 AM
Quick Sort -------------
http://www.seeingwithc.org/topic2html.html
SudDecember 28, 2011 at 10:41 AM
Counting Sort----------

#define M 3
int main()
{
int arr[]={0,1,2,0,0,0,1,1,2,2,2};
int count[M];
int i,j,len;
len = sizeof(arr)/sizeof(arr[0]);
printf("len:%d\n",len);
for(i=0;i < M;i++)
count[i]=0;
for(i=0;i < len;i++)
++count[arr[i]];
printf("I m here\n");
for(i=0,j=0;j < M;j++)
{
while(count[j]--)
arr[i++] = j;
}
printf("I m here\n");
for(i=0;i < len;i++)
printf("arr:%d\n",arr[i]);
return 0;
}
SudJanuary 4, 2012 at 10:43 AM
Quick Sort--------

#include < iostream >
#include < stdlib.h >
#include < conio.h >

int Partition(int a[] , int low, int high)
{
int left,right,temp;
int pivot_item;
pivot_item=a[low];
left=low;
right=high;

while(left < right)
{while(a[left] < =pivot_item)
left++;
while(a[right] > pivot_item)
right--;
if(left < right)
{temp=a[left];
a[left]=a[right];
a[right]=temp;}

}

a[low]=a[right];
a[right]=pivot_item;
return right;
}

int QuickSort(int a[], int low, int high)
{ int pivot;
if(high > low)
{ pivot=Partition(a,low,high);
QuickSort(a,low,pivot-1);
QuickSort(a,pivot+1,high);
}
}

int main()
{
int n,low,high,i;

int a[]={54,23,98,143,2,46,34,76};
n= sizeof(a)/sizeof(a[0]);

printf("Initial Order of elements\n");
for(i=0;i < n;i++)
printf("%d\n",a[i]);

QuickSort(a,0,n-1);

printf("Final Array After Sorting:\n");
for(i=0;i < n;i++)
printf("%d\n",a[i]);

getch();
return 0;
}
SudJanuary 21, 2012 at 10:45 PM
int Partition(int a[] , int low, int high)
{
int left,right,temp;
int pivot_item;
pivot_item=a[low];
left=low;
right=high;

while(left < right)
{while(a[left] < =pivot_item)
left++;
while(a[right] > pivot_item)
right--;
if(left < right)
{temp=a[left];
a[left]=a[right];
a[right]=temp;}

}

a[low]=a[right];
a[right]=pivot_item;
return right;
}

int QuickSort(int a[], int low, int high)
{ int pivot;
if(high > low)
{ pivot=Partition(a,low,high);
QuickSort(a,low,pivot-1);
QuickSort(a,pivot+1,high);
}
}
SudOctober 11, 2012 at 11:56 AM
http://blog4preps.blogspot.in/search/label/Sorting%20Techniques
LohithOctober 18, 2017 at 5:01 AM
Hi,

Thanks for sharing this article. Very helpful.
http://www.flowerbrackets.com/bubble-sort-program-in-java/

Cheers
tachjavaJanuary 23, 2018 at 6:58 AM
Hi,

Awesome!! You got the best questions and answers for java interview. You're doing a great job.
Thanks for sharing.

Cheers,
http://www.flowerbrackets.com/insertion-sort-in-java/
tachjavaMarch 12, 2018 at 1:42 AM
All the sorting algorithms and links are too good. Very useful.

Thanks for sharing.
http://www.flowerbrackets.com/best-way-to-implement-selection-sort-in-java/
tachjavaMarch 27, 2018 at 4:18 AM
You have the best collection of links for sorting algorithms. Thanks for sharing.

Cheers,
http://www.flowerbrackets.com/how-to-implement-quick-sort-in-java-program/
tachjavaMay 11, 2018 at 5:53 AM
This post has best links with elaborate explanation on sorting algorithms. Thanks for sharing.

Cheers,
http://www.flowerbrackets.com/java-merge-sort/

Labels

Sunday, December 11, 2011

Sorting Algorithms

10 comments: