Section 2.12 Programming Exercises
-
Devise an experiment to verify that the vector index operator is
-
Devise an experiment to verify that find and insert are
for hash tables. -
Devise an experiment that compares the performance of the
erase()
operator on vectors and hash tables. -
Given an array of numbers in random order, write an algorithm that works in
to find the kth smallest number in the array. -
Can you improve the algorithm from the previous problem to be linear? Explain.
You have attempted 1 of 1 activities on this page.