3
answers
1
watching
262
views
6 May 2021
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
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 |
tanimpala456Lv1
17 May 2021
Already have an account? Log in