The idea of Bucket Sort is to divide the interval [0, 1] into n equal-sized sub intervals, or buckets, and then distribute the n input numbers into the buckets. To produce the output, we simply sort the numbers in each bucket and then go through the buckets in order, listing elements in each.
Bucket sort runs in linear time when the input is drawn from a uniform distribution. Read more about C Programming Language .
/*********************************************************** * You can use all the programs on www.c-program-example.com * for personal and learning purposes. For permissions to use the * programs for commercial purposes, * contact [email protected] * To find more C programs, do visit www.c-program-example.com * and browse! * * Happy Coding ***********************************************************/ #include<stdio.h> void Bucket_Sort(int array[], int n) { int i, j; int count[n]; for(i=0; i < n; i++) { count[i] = 0; } for(i=0; i < n; i++) { (count[array[i]])++; } for(i=0,j=0; i < n; i++) { for(; count[i]>0;(count[i])--) { array[j++] = i; } } } int main() { int array[100]; int num; int i; printf("Enter How many Numbers : "); scanf("%d",&num); printf("Enter the %d elements to be sorted:n",num); for(i = 0; i < num; i++ ) { scanf("%d",&array[i]); } printf("nThe array of elements before sorting : n"); for (i = 0;i < num;i++) { printf("%d ", array[i]); } printf("nThe array of elements after sorting : n"); Bucket_Sort(array, num); for (i = 0;i < n;i++) { printf("%d ", array[i]); } printf("n"); return 0; }
Read more Similar C Programs Data Structures C Sorting
You can easily select the code by double clicking on the code area above.
To get regular updates on new C programs, you can Follow @c_program
You can discuss these programs on our Facebook Page. Start a discussion right now,
our page!
Share this program with your Facebook friends now! by liking it
(you can send this program to your friend using this button)
Like to get updates right inside your feed reader? Grab our feed!
To browse more C Programs visit this link
Or if you can’t find the program you are looking for, you can contact [email protected]. Thank you for visiting.