Repository navigation
Expand file tree
/
Copy pathbucket_sort.java
More file actions
69 lines (59 loc) · 1.8 KB
/
Copy pathbucket_sort.java
File metadata and controls
69 lines (59 loc) · 1.8 KB
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import java.util.ArrayList;
import java.util.Collections;
public class bucket_sort extends Sorts{
public bucket_sort(int[] parameters)
{
super(parameters, parameters.length, "Bucket Sort");
}
public void sort()
{
startTime = System.nanoTime();
int i;
ArrayList<Integer>[] buckets = new ArrayList[10];
for(i=0;i<10;i++)
buckets[i] = new ArrayList<>();
int max = parameters[0];
int min = parameters[0];
for(i=0;i<size;i++)
{
if(max < parameters[i])max = parameters[i];
if(min > parameters[i])min = parameters[i];
}
duration = System.nanoTime() - startTime;
saveTimeState();
saveState();
// If all elements are the same, handle this case
if (max == min) {
return; // No sorting is necessary
}
for(i=0;i<size;i++)
{
int bucket = (parameters[i] - min)*9 / (max-min);
buckets[bucket].add(parameters[i]);
duration = System.nanoTime() - startTime;
saveTimeState();
saveState();
}
duration = System.nanoTime() - startTime;
saveTimeState();
saveState();
for(i=0;i<10;i++)
{
Collections.sort(buckets[i]);
}
int k=0;
for(i=0;i<10;i++)
{
while(!buckets[i].isEmpty())
{
parameters[k++] = buckets[i].remove(0);
duration = System.nanoTime() - startTime;
saveTimeState();
saveState();
}
}
duration = System.nanoTime() - startTime;
saveTimeState();
saveState();
}
}