forked from IvanLu1024/Java-Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
65 lines (50 loc) · 1.73 KB
/
Copy pathMain.java
File metadata and controls
65 lines (50 loc) · 1.73 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
package code_10_avl;
import code_10_avl.map.BSTMap;
import java.util.ArrayList;
import java.util.Collections;
/**
* Created by 18351 on 2018/12/29.
*/
public class Main {
public static void main(String[] args) {
System.out.println("Pride and Prejudice");
ArrayList<String> words = new ArrayList<>();
if(FileOperation.readFile("pride-and-prejudice.txt", words)) {
System.out.println("Total words: " + words.size());
Collections.sort(words);
// Test BST
long startTime = System.nanoTime();
BSTMap<String, Integer> bst = new BSTMap<>();
for (String word : words) {
if (bst.contains(word)){
bst.set(word, bst.get(word) + 1);
}else{
bst.add(word, 1);
}
}
for(String word: words){
bst.contains(word);
}
long endTime = System.nanoTime();
double time = (endTime - startTime) / 1000000000.0;
System.out.println("BST: " + time + " s");
// Test AVL Tree
startTime = System.nanoTime();
AVLTree<String, Integer> avl = new AVLTree<>();
for (String word : words) {
if (avl.contains(word)){
avl.set(word, avl.get(word) + 1);
}else{
avl.add(word, 1);
}
}
for(String word: words){
avl.contains(word);
}
endTime = System.nanoTime();
time = (endTime - startTime) / 1000000000.0;
System.out.println("AVL: " + time + " s");
}
System.out.println();
}
}