Add Bead Sort (#3761)

This commit is contained in:
Hyun
2022-11-10 04:33:30 +09:00
committed by GitHub
parent b8d6b1a9b0
commit 4990f791a6
2 changed files with 87 additions and 0 deletions

View File

@ -0,0 +1,45 @@
package com.thealgorithms.sorts;
//BeadSort Algorithm(wikipedia) : https://en.wikipedia.org/wiki/Bead_sort
//BeadSort can't sort negative number, Character, String. It can sort positive number only
public class BeadSort {
public int[] sort(int[] unsorted) {
int[] sorted = new int[unsorted.length];
int max = 0;
for(int i = 0; i < unsorted.length; i++) {
max = Math.max(max, unsorted[i]);
}
char[][] grid = new char[unsorted.length][max];
int[] count = new int[max];
for(int i = 0; i < unsorted.length; i++) {
for(int j = 0; j < max; j++) {
grid[i][j] = '-';
}
}
for(int i = 0; i < max; i++) {
count[i] = 0;
}
for(int i = 0; i < unsorted.length; i++) {
int k = 0;
for(int j = 0; j < (int) unsorted[i] ; j++) {
grid[count[max - k - 1]++][k] = '*';
k++;
}
}
for(int i = 0; i < unsorted.length; i++) {
int k = 0;
for(int j = 0; j < max && grid[unsorted.length - 1 - i][j] == '*'; j++) {
k++;
}
sorted[i] = k;
}
return sorted;
}
}