-
Notifications
You must be signed in to change notification settings - Fork 1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1422 from aleena-james/dev
Added bucket_sort.c and Modified Readme.md
- Loading branch information
Showing
2 changed files
with
160 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,159 @@ | ||
| /*Bucket Sort is a sorting technique that sorts the elements by first dividing the elements into several groups called buckets. | ||
| The elements inside each bucket are sorted using any of the suitable sorting algorithms or recursively calling the same algorithm. | ||
| Several buckets are created. Each bucket is filled with a specific range of elements. | ||
| The elements inside the bucket are sorted using any other algorithm. | ||
| Finally, the elements of the bucket are gathered to get the sorted array.*/ | ||
|
|
||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
|
|
||
| #define ARRAY 10 // Array size | ||
| #define BUCKET 9 // Number of buckets | ||
| #define BREAK 13 // Each bucket capacity | ||
|
|
||
| struct Node { | ||
| int data; | ||
| struct Node *next; | ||
| }; | ||
|
|
||
| void bucketsort(int arr[]); | ||
| struct Node *InsertionSort(struct Node *list); | ||
| void print(int arr[]); | ||
| void printBuckets(struct Node *list); | ||
| int getBucketIndex(int value); | ||
|
|
||
| // Sorting function | ||
| void bucketsort(int arr[]) { | ||
| int i, j; | ||
| struct Node **buckets; | ||
|
|
||
| // Create buckets and allocate memory size | ||
| buckets = (struct Node **)malloc(sizeof(struct Node *) * BUCKET); | ||
|
|
||
| // Initialize empty buckets | ||
| for (i = 0; i < BUCKET; ++i) { | ||
| buckets[i] = NULL; | ||
| } | ||
|
|
||
| // Fill the buckets with respective elements | ||
| for (i = 0; i < ARRAY; ++i) { | ||
| struct Node *current; | ||
| int pos = getBucketIndex(arr[i]); | ||
| current = (struct Node *)malloc(sizeof(struct Node)); | ||
| current->data = arr[i]; | ||
| current->next = buckets[pos]; | ||
| buckets[pos] = current; | ||
| } | ||
|
|
||
| // Print the buckets along with their elements | ||
| for (i = 0; i < BUCKET; i++) { | ||
| printf("Bucket[%d]: ", i); | ||
| printBuckets(buckets[i]); | ||
| printf("\n"); | ||
| } | ||
|
|
||
| // Sort the elements of each bucket | ||
| for (i = 0; i < BUCKET; ++i) { | ||
| buckets[i] = InsertionSort(buckets[i]); | ||
| } | ||
|
|
||
| printf("-------------\n"); | ||
| printf("Bucktets after sorting\n"); | ||
| for (i = 0; i < BUCKET; i++) { | ||
| printf("Bucket[%d]: ", i); | ||
| printBuckets(buckets[i]); | ||
| printf("\n"); | ||
| } | ||
|
|
||
| // Put sorted elements on arr | ||
| for (j = 0, i = 0; i < BUCKET; ++i) { | ||
| struct Node *node; | ||
| node = buckets[i]; | ||
| while (node) { | ||
| arr[j++] = node->data; | ||
| node = node->next; | ||
| } | ||
| } | ||
|
|
||
| return; | ||
| } | ||
|
|
||
| // Function to sort the elements of each bucket | ||
| struct Node *InsertionSort(struct Node *list) { | ||
| struct Node *k, *nodeList; | ||
| if (list == 0 || list->next == 0) { | ||
| return list; | ||
| } | ||
|
|
||
| nodeList = list; | ||
| k = list->next; | ||
| nodeList->next = 0; | ||
| while (k != 0) { | ||
| struct Node *ptr; | ||
| if (nodeList->data > k->data) { | ||
| struct Node *tmp; | ||
| tmp = k; | ||
| k = k->next; | ||
| tmp->next = nodeList; | ||
| nodeList = tmp; | ||
| continue; | ||
| } | ||
|
|
||
| for (ptr = nodeList; ptr->next != 0; ptr = ptr->next) { | ||
| if (ptr->next->data > k->data) | ||
| break; | ||
| } | ||
|
|
||
| if (ptr->next != 0) { | ||
| struct Node *tmp; | ||
| tmp = k; | ||
| k = k->next; | ||
| tmp->next = ptr->next; | ||
| ptr->next = tmp; | ||
| continue; | ||
| } else { | ||
| ptr->next = k; | ||
| k = k->next; | ||
| ptr->next->next = 0; | ||
| continue; | ||
| } | ||
| } | ||
| return nodeList; | ||
| } | ||
|
|
||
| int getBucketIndex(int value) { | ||
| return value / BREAK; | ||
| } | ||
|
|
||
| void print(int ar[]) { | ||
| int i; | ||
| for (i = 0; i < ARRAY; ++i) { | ||
| printf("%d ", ar[i]); | ||
| } | ||
| printf("\n"); | ||
| } | ||
|
|
||
| // Print buckets | ||
| void printBuckets(struct Node *list) { | ||
| struct Node *cur = list; | ||
| while (cur) { | ||
| printf("%d ", cur->data); | ||
| cur = cur->next; | ||
| } | ||
| } | ||
|
|
||
| // Driver code | ||
| int main(void) { | ||
| int array[ARRAY] = {44, 23, 33, 62, 57, 47, 51, 88, 14, 66}; | ||
|
|
||
| printf("Initial array: "); | ||
| print(array); | ||
| printf("\n"); | ||
|
|
||
| bucketsort(array); | ||
| printf("\n"); | ||
| printf("Sorted array: "); | ||
| print(array); | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters