C S 314 Midterm: Spring_2016_E1
Document Summary
Points off 1 2 3 4 total off net score. Instructions: there are 4 questions on this test. Scores will be scaled to 180 points: you have 2 hours to complete the test, place you final answers on this test. 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 o(n4). I want the most restrictive, correct big o function. (closest without going under. ) Recall, t(n) is a function that represents the actual number of executable statements for an algorithm. Method process is o(n) where n is the length of the list argument sent to the method. N = list. size() public double methodd(arraylist list, double t) {
