#1. What is the sum of 0 .. 2000 ( i.e., 0 + 1 + 2 + ... + 2000) ?

#2. What is the growth rate of Selection Sort? (use Big-oh notation)

#3. What is the growth rate of Binary Search? (use Big-oh notation)

#4. If Selection Sort requires 10 seconds to sort 15,000 elements, hwo long do you expect that Selection Sort will require to sort 45,000 elements? (Show your work clearly.)

#5. If Binary Search requires 10 seconds to search 15,000 elements, how long do you expect that Binary Search will require to search 45,000 elements? (Show your work clearly.) You may use that log (base 2) of 15,000 is approximately 13.9 and log (base 2) of 45,000 is approximately 15.5.

Return to Eleanor Hare's home page.

Return to Department of Computer Science Home page.