Bucket Sort Algorithm - The Coding Shala

Last Updated: 20-Jan-2021
Home >> Algorithms >> Bucket Sort

 In this post, we will learn what is Bucket Sort Algorithm and will write a Java program to implement Bucket Sort.

Bucket Sort Algorithm

Bucket Sort is a sorting algorithm. In bucket sort, we create n buckets and insert similar types of elements into the buckets. Bucket sort is mainly useful when input is uniformly distributed over a range. For example, a large set of floating-point numbers are in the range from 0.0 to 1.0 and uniformly distributed across the range. Another example a large set of numbers which are in the range from 1 to 99.

In these types of cases, we use the bucket sort algorithm.

Working of Bucket Sort Algorithm

The following steps need to follow for the Bucket Sort Algorithm:
  • Step 1. First, we create n empty buckets/lists.
  • Step 2. Now for every element arr[i] of given array we insert arr[i] into buckets. Now the main point is how to insert into buckets. How we decide that? If array element are floating numbers over range 0.0 to 1.0 we can do n*arr[i] and insert into bucket[n*arr[i]]. Similarly, we can find some relation and insert it into buckets.
  • Step 3. we sort individual buckets using insertion sort or merge sort.
  • Step 4. Concatenate all the sorted buckets.

Example of Bucket Sort Algorithm

Here is an example of the bucket sort algorithm
Input array -> 0.78 0.17 0.39 0.26 0.72 0.94 0.21 0.12 0.23 0.68

create 10 buckets
0    1          2          3     4     5      6        7      8        9
       |           |       |        |        |          |
     0.12     0.21    0.39    0.68    0.72       0.94
       |           |                |
     0.17     0.23      0.78
           |
         0.26

Sorted Output-> 0.12 0.17 0.21 0.23 0.26 0.39 0.68 0.72 0.78 0.94

Time Complexity of Bucket Sort Algorithm

The time complexity of Bucket sort in the worst case is O(n logn) and in the average case is O(n).

Bucket Sort Algorithm Java Program

The following Java program explains the bucket sort algorithm: 

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

//bucket sort
//the coding shala

class Main{
	
	public static void bucket_sort(double[] input) {
		int len = input.length;
		//create empty buckets
		List[] bucket = new List[10];
		for(int i=0; i<bucket.length; i++) {
			bucket[i] = new ArrayList<Double>();
		}
		//insert into buckets
		for(int i=0; i<len; i++) {
			int index = (int)(10*input[i]);
			bucket[index].add(input[i]);
		}
		//check bucket
		/*for(int i=0; i<10; i++) {
			for(int j = 0; j<bucket[i].size(); j++) {
				System.out.print(bucket[i].get(j)+" ");
			}
			System.out.println();
		}*/
		
		//sort individual buckets
		for(int i=0; i<10; i++) {
			Collections.sort(bucket[i]);
		}
		
		//store back into input array
		int in = 0;
		for(int i=0; i<10; i++) {
			for(int j = 0; j<bucket[i].size(); j++) {
				input[in] = (double)bucket[i].get(j);
				in++;
			}
		}
	}
	
	public static void main(String[] args) {
		double[] input = {0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.12, 0.23, 0.68};
		int len = input.length;
		bucket_sort(input);
		for(int i=0;i<len;i++) {
			System.out.print(input[i]+" ");
		}
	}
}

Here is another example of the bucket sort

An input array is a number between 1 to 99.

Java Program: 

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

//bucket sort
//the coding shala

class Main{
	
	public static void bucket_sort(int[] input) {
		int len = input.length;
		//create empty buckets
		List[] bucket = new List[10];
		for(int i=0; i<bucket.length; i++) {
			bucket[i] = new ArrayList<Integer>();
		}
		//insert into buckets
		for(int i=0; i<len; i++) {
			int index = (input[i]/10);
			bucket[index].add(input[i]);
		}
		//check bucket
		/*for(int i=0; i<10; i++) {
			for(int j = 0; j<bucket[i].size(); j++) {
				System.out.print(bucket[i].get(j)+" ");
			}
			System.out.println();
		}*/
		
		//sort individual buckets
		for(int i=0; i<10; i++) {
			Collections.sort(bucket[i]);
		}
		
		//store back into input array
		int in = 0;
		for(int i=0; i<10; i++) {
			for(int j = 0; j<bucket[i].size(); j++) {
				input[in] = (int)bucket[i].get(j);
				in++;
			}
		}
	}
	
	public static void main(String[] args) {
		int[] input = {80, 50, 30, 10, 90, 60, 0, 70, 40, 20, 50};
		int len = input.length;
		bucket_sort(input);
		for(int i=0;i<len;i++) {
			System.out.print(input[i]+" ");
		}
	}
}


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Introduction to Kotlin Programming Language for Backend Development - The Coding Shala

Home >> Learn Kotlin >> Kotlin Introduction Are you looking for a powerful and reliable programming language for backend development? Look no further than Kotlin. Kotlin is a modern, statically typed programming language that has gained a lot of popularity in recent years. In this blog post, we'll take a look at what Kotlin is and why it's a great choice for backend development. What is Kotlin? Kotlin is a statically typed, cross-platform, general-purpose programming language that was developed by JetBrains in 2011. It is designed to be more concise, expressive, and safe than Java, the most widely used programming language for Android development. Kotlin can be compiled to run on the Java Virtual Machine (JVM), JavaScript, and native platforms, making it a versatile language for different types of applications. Why use Kotlin for backend development? Kotlin has several features that make it a suitable language for backend development, such as: Concisenes...
Read more