POL SCI 124C Lecture 20: PS124C section 4.4.2018

48 views2 pages

coralserval818

6 Apr 2018

School

Department

Course

Professor

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

Related Questions

57. Line 5 (A) for (int j = -i*2; j<= i*2; j++){ (B) for (int j = 0; j< i+2+1; j++){ (C) for (int j = -i; j> i; j++) { (D) for (int j = 0; j<= i*2; j++){ (E) for (int j = i; j<= i+2; j+i) {

55. Line 3 (A) for (int j = height; j< height - i; j+-height) { (B) for (int j = 0; j< 2 + height; j+=height) { (C) for (int j = 0; j< height - i * 2; j++) { (D) for (int j = 0; j< height - i-1; j++) { (E) for (int j = 0; j< height ; j++) {

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?

Partition (A, p, r) ▷ p ≤ r

1 x := A[r] ▷ pivot

2 i := p − 1

3 for j := p to r − 1

4 if A[ j] ≤ x

5 i := i + 1

6 change A[i] with A[ j]

7 changeA[i+1] with A[r]

8 return i + 1

pearchinchilla354

POL SCI 124C Lecture 20: PS124C section 4.4.2018

Get access

Related Documents

POL SCI 124C Lecture 24: PS124C Lecture 24 4.19.2018

POL SCI 124C Lecture 4: PS124C Section 4

POL SCI 124C Lecture 2: PS124C section 2

Related Questions