C S 314 Final: Spring_2015_Final
Document Summary
Points off 1 2 3 4a 4b 5 total off net score. Instructions: there are 5 questions on this test. 100 points available: you have 3 hours to complete the test, place you answers on this test. Not the scratch paper: you may not use a calculator or any other electronic devices while taking the test, when writing a method, assume the preconditions of the method are met. Place your answer on the line next to or under the question. For example selection sort has an average case big o of o(n2), but per the formal definition of big o it is correct to say selection sort also has a big o of o(n3) or. I want the most restrictive, correct big o function. (closest without going under. ) A method uses the traditional insertion sort algorithm to sort an array of ints. 2 seconds to complete when sorting an array of 20,000 distinct ints in random order.
