C S 314 Midterm: Spring_2017_E1
Document Summary
Points off 1 2 3 4 5 6 total off net score. Instructions: there are 6 questions on this test. Scores will be scaled to 175 points: you have 2 hours to complete the test, place your 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. ) Assume the println statement in methodb is commented in. If list contains 1000 distinct result = temp; count++; N = data. length if (data[i] || data[j]) r++; Intlist res = new intlist(); for (int i = 0; i < n; i++) { return res; res. add(r. nextint());