-
Notifications
You must be signed in to change notification settings - Fork 0
/
BucketSortv1.java
70 lines (65 loc) · 2.33 KB
/
BucketSortv1.java
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
70
import java.io.*;
import java.util.*;
public class BucketSortv1{
private static TreeMap<Character,ArrayList<String>> mainbucket=new TreeMap<Character,ArrayList<String>>();
private static File source=new File("stringsupdown.txt");
private static String[] result;
public static void main(String[] args){
int option=0,count,length;
try {
readStrings();
} catch (FileNotFoundException e) {}
while(option!=3){
System.out.println("This is a demo of Bucket Sort");
System.out.println("1. View Strings");
System.out.println("2. Sort Strings");
System.out.println("3. Exit");
System.out.print("Mode : ");
Scanner modeInput= new Scanner(System.in);
option=modeInput.nextInt();
switch(option){
case 1:
System.out.println();
showStrings();
System.out.println();
break;
case 2:
sortStrings();
System.out.println();
break;
default:
modeInput.close();
break;
}
}
}
private static void readStrings() throws FileNotFoundException{
Scanner sourceRead=new Scanner(source);
String value;
Character key;
while(sourceRead.hasNextLine()){
value=sourceRead.next();
key=Character.toLowerCase(value.charAt(0));
if(mainbucket.get(key)==null){
mainbucket.put(key,new ArrayList<String>());
}
mainbucket.get(key).add(value);
}
sourceRead.close();
}
private static void showStrings(){
for(Map.Entry<Character,ArrayList<String>> itr:mainbucket.entrySet()){
System.out.print(itr.getKey()+": ");
for(String x:itr.getValue()){
System.out.print(x+" ");
}
System.out.println();
}
}
private static void sortStrings(){
for(Map.Entry<Character,ArrayList<String>> itr:mainbucket.entrySet()){
Collections.sort(itr.getValue());
}
System.out.println("Strings has been sorted");
}
}