Sears Russell
|
18c772234d
|
new benchmarks revealed that inserts for linkedList, pageOrientedList were taking O(n) time, yielding O(n^2)
time to build a list, since the lists could not contain duplicate keys. These operations are now O(1), and
the lists can contain duplicates.
|
2005-03-10 20:10:49 +00:00 |
|