COMP 2150 Lecture 7: Lecture 7

20 views2 pages

violetmole948

21 Sep 2018

School

University of Manitoba

Department

Computer Science

Course

COMP 2150

Professor

Mike Domaratzki

For unlimited access to Class Notes, a Class+ subscription is required.

Related Questions

31. What is printed by the following code in base 2? int sum = 0; for (int x = 0; x< 5; x++) sum+=x; System.out.println(sum); 21 x 21 + 0 x 23+1 22 +1 x 21 +1 x 20

22. Consider the array a = {5,7,1,4,1}. If we sort this array using the Selection Sort (code 2) algorithm described in the appendix, what will be displayed the first time the print statement on line 7 executes? (A) [1,1,5,4,7] (B) (1,7,5,4,1] (C) Nothing (D) (1,1,7,4,5) (E) (1,7,1,4,5)

Submit the vector [33 44 55 77 95 99 22 25 41 66 88 89] to the Quicksort Partition algorithm. What is the final state of the vector? 
What index does the algorithm return?