Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
Bucket sort is mainly useful when input is uniformly distributed over a range. For example, Sort a large set of floating point numbers which are in range from 0.0 to 1.0 and are uniformly distributed across the range. Here we can use bucket sort to solve the problem efficiently.
The program would be implemented in C++ language.
I request mentors to assign me this issue for GSSOC '21.
Bucket Sort Algorithm
Bucket sort is mainly useful when input is uniformly distributed over a range. For example, Sort a large set of floating point numbers which are in range from 0.0 to 1.0 and are uniformly distributed across the range. Here we can use bucket sort to solve the problem efficiently.
The program would be implemented in C++ language.
I request mentors to assign me this issue for GSSOC '21.