C S 314 Final: Spring_2018_Final
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 300 points: you have 3 hours to complete the test, place your final answers on this test, not on scratch paper. 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. Min and max heaps typically use arrays as internal storage containers. The best case of the quicksort algorithm occurs when the pivot is the median value of the unsorted data. System. out. print(" " + c); c++; if (x == 0) else return 1; return e2(x - 1) + e2(x - 1);