GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — java-basics/java-programs/BucketSort.java at master · learning-zone/java-basics

Expand file tree

/

BucketSort.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
33 lines (31 loc) · 709 Bytes
/

BucketSort.java

Copy path

File metadata and controls

33 lines (31 loc) · 709 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
package misc;
import java.util.Arrays;
/**
* Bucket Sort is also known as bin sort.
* It works by distributing the element into the array also called buckets.
*
*/
public class BucketSort {
public static int[] bucketSort(int[] arr) {
int i, j;
int[] bucket = new int[arr.length + 1];
Arrays.fill(bucket, 0);
for(i = 0; i < arr.length; i++) {
bucket[arr[i]]++;
}
int k = 0;
for(i = 0; i <= arr.length; i++) {
for(j = 0; j < bucket[i]; j++) {
arr[k++] = i;
}
}
return arr;
}
public static void main(String[] args) {
int[] num = {3, 6, 1, 7, 2, 8, 10, 4, 9, 5};
bucketSort(num);
for(int i = 0; i < num.length; i++) {
System.out.print(num[i] + " ");
}
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.