forked from argonautica/sorting-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
40 additions
and
0 deletions.
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,40 @@ | ||
#include<iostream> | ||
#include<vector> | ||
#include<algorithm> | ||
using namespace std; | ||
void display(float *array, int size) { | ||
for(int i = 0; i<size; i++) | ||
cout << array[i] << " "; | ||
cout << endl; | ||
} | ||
void bucketSort(float *array, int size) { | ||
vector<float> bucket[size]; | ||
for(int i = 0; i<size; i++) { //put elements into different buckets | ||
bucket[int(size*array[i])].push_back(array[i]); | ||
} | ||
for(int i = 0; i<size; i++) { | ||
sort(bucket[i].begin(), bucket[i].end()); //sort individual vectors | ||
} | ||
int index = 0; | ||
for(int i = 0; i<size; i++) { | ||
while(!bucket[i].empty()) { | ||
array[index++] = *(bucket[i].begin()); | ||
bucket[i].erase(bucket[i].begin()); | ||
} | ||
} | ||
} | ||
int main() { | ||
int n; | ||
cout << "Enter the number of elements: "; | ||
cin >> n; | ||
float arr[n]; //create an array with given number of elements | ||
cout << "Enter elements:" << endl; | ||
for(int i = 0; i<n; i++) { | ||
cin >> arr[i]; | ||
} | ||
cout << "Array before Sorting: "; | ||
display(arr, n); | ||
bucketSort(arr, n); | ||
cout << "Array after Sorting: "; | ||
display(arr, n); | ||
} |