report.txt

真的很麻烦也

DSASet 1: implement by a linear list; 
run time: 
add(): O(1)
remove(): O(n)
contains(): O(n)
clear(): O(1)
isEmpty(): O(1)
size(): O(1)

DSASet 2: implement by a binary search tree.
add(): O(h)
remove(): O(h)
contains(): O(h)
clear(): O(1)
isEmpty(): O(1)
size(): O(1)
test time: 50000

Test1:
		DSASet time	DSASet2 time
add(): 		80		1923
remove(): 		60106		1502
check(): 		63692		1252

Test2:
		DSASet time	DSASet2 time
add(): 		80		1780
remove(): 		59886		1372
check(): 		63691		1122

Test3:
		DSASet time	DSASet2 time
add(): 		70		1842
remove(): 		62730		1433
check(): 		62732		1171

Average:
		DSASet time	DSASet2 time
add(): 		76.67		1848.33
remove(): 		60907.33		1435.67
check(): 		63371.67		1181.67