POL301Y1 Lecture : lecture notes

38 views3 pages

raspberryllama591

26 Sep 2011

School

Department

Course

Professor

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

Related Questions

20. How many times does the letter D print in the following code? for (int i = 0; i < 3; i++) { for (int j = i+1; j < 3; j++) System.out.println("D"); { (A) 3 (B) 0 (C) 6 (D) 1 (E) 2

18. How many times does the letter B print in the following code? for (int i = 0; i < 6; i++) { for (int j = 0; j <= 5; j++) System.out.println("B"); { (A) 36 (B) 5 (C) 0 (D) 30 (E) 11

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?