Skip to content

Commit

Permalink
Merge pull request AdarshAddee#163 from Utkarsh-190/main
Browse files Browse the repository at this point in the history
added bucketSort algorithm
  • Loading branch information
AdarshAddee committed Oct 4, 2022
2 parents 7e104ad + 89ad779 commit 5b140c2
Showing 1 changed file with 50 additions and 0 deletions.
50 changes: 50 additions & 0 deletions C++/bucketSort.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
/*
Authors Name : Utkarsh Tyagi
Date Modified: 1 October, 2022
*/
// C++ program to sort an
// array using bucket sort
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

// Function to sort arr[] of
// size n using bucket sort
void bucketSort(float arr[], int n)
{

// 1) Create n empty buckets
vector<float> b[n];

// 2) Put array elements
// in different buckets
for (int i = 0; i < n; i++) {
int bi = n * arr[i]; // Index in bucket
b[bi].push_back(arr[i]);
}

// 3) Sort individual buckets
for (int i = 0; i < n; i++)
sort(b[i].begin(), b[i].end());

// 4) Concatenate all buckets into arr[]
int index = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < b[i].size(); j++)
arr[index++] = b[i][j];
}

/* Driver program to test above function */
int main()
{
float arr[]
= { 0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434 };
int n = sizeof(arr) / sizeof(arr[0]);
bucketSort(arr, n);

cout << "Sorted array is \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
return 0;
}

0 comments on commit 5b140c2

Please sign in to comment.