\l
The first 2 multiple choice questions are worth 4 marks each. For each such question: If you get 1
part wrong, you get 3 marks; if you get 2 parts wrong, you get 2 marks; and if you get 3 or more
parts wrong, you get 0 marks. For Big-O, let us assu
Project 2
Yu-En (Ian) Yang
CS id: a0n8
Yihang Shi
CS id: g3k8
Sorted vector (resizing array)
Style of input:
We first insert integers from 1 to 10000 (in order) into all the mystery data structures, record the data
and remove all elements in all data stru
Hash table with quadratic probing (resizing)
Style of input:
Same as the above test for sorted vector.
Hypothesis:
From the results in the previous test, there should be a data structure that has a total runtime of (n)
for both insertions, and has occasio