48 29 8 59 72 88 42 65 95 19 82 68

0 1 2 3 4 5 6 7 8 9 10 11
Step1: initialized pivot, left, right

48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1(L) 2 3 4 5 6 7 8 9 10 11(R)
Step1.1.1 check a[p]<a[L] then stop otherwise increase the value of L

48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1 2(L) 3 4 5 6 7 8 9 10 11(R)
Step1.1.2 check a[p]<a[L] then stop otherwise increase the value of L

48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1 2 3(L) 4 5 6 7 8 9 10 11(R)
48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1 2 3(L) 4 5 6 7 8 9 10 11(R)
Step1.2.1 check a[p]>a[R] then stop otherwise decrease the value of R
Step1.2.2

48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1 2 3(L) 4 5 6 7 8 9 10(R) 11

48 29 8 59 72 88 42 65 95 19 82 68
0(p) 1 2 3(L) 4 5 6 7 8 9(R) 10 11
Step1.2.3

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3(L) 4 5 6 7 8 9(R) 10 11

Step1.3.1

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6 7 8 9(R) 10 11

Step1.4.1

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6 7 8 9(R) 10 11

Step1.4.2

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6 7 8(R) 9 10 11
 Step1.4.3

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6 7(R) 8 9 10 11

Step 1.4.4

48 29 8 19 72 88 42 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6(R) 7 8 9 10 11

48 29 8 19 42 88 72 65 95 59 82 68
0(p) 1 2 3 4(L) 5 6(R) 7 8 9 10 11

Step 1.5.1
48 29 8 19 42 88 72 65 95 59 82 68
0(p) 1 2 3 4 5(L) 6(R) 7 8 9 10 11

Step 1.6.1
48 29 8 19 42 88 72 65 95 59 82 68
0(p) 1 2 3 4 5(L)(R) 6 7 8 9 10 11

Step 1.6.2
48 29 8 19 42 88 72 65 95 59 82 68
0 1 2 3 4(R) 5(L) 6 7 8 9 10 11

Step 1.7: R<L so swap between a[p] and a[r]

42 29 8 19 48 88 72 65 95 59 82 68
0 1 2 3 4 5 6 7 8 9 10 11
Step 2.1

42 29 8 19 48 88 72 65 95 59 82 68
0(p) 1(L) 2 3(R) 4 5 6 7 8 9 10 11

Step 2.1.1

42 29 8 19 48 88 72 65 95 59 82 68
0(p) 1 2(L) 3(R) 4 5 6 7 8 9 10 11

Step 2.1.2

42 29 8 19 48 88 72 65 95 59 82 68
0(p) 1 2(L) 3(R) 4 5 6 7 8 9 10 11

Step 2.1.3
 42 29 8 19 48 88 72 65 95 59 82 68
0(p) 1 2 3(R)(L) 4 5 6 7 8 9 10 11

Step 2.1.4

42 29 8 19 48 88 72 65 95 59 82 68
0(p) 1 2 3(R) (L)4 5 6 7 8 9 10 11

Step 2.2: R<L so swap between a[p] and a[r]

19 29 8 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5 6 7 8 9 10 11

Step 3

19 29 8 42 48 88 72 65 95 59 82 68
0(p) 1(L) 2(R) 3 4 5 6 7 8 9 10 11

Step 3.1

19 29 8 42 48 88 72 65 95 59 82 68
0(p) 1(L) 2(R) 3 4 5 6 7 8 9 10 11

Step 3.2

19 29 8 42 48 88 72 65 95 59 82 68
0(p) 1(L) 2(R) 3 4 5 6 7 8 9 10 11

Step 3.3

19 8 29 42 48 88 72 65 95 59 82 68
0(p) 1(L) 2(R) 3 4 5 6 7 8 9 10 11

Step 3.4

19 8 29 42 48 88 72 65 95 59 82 68
0(p) 1 2(R)(L) 3 4 5 6 7 8 9 10 11

Step 3.5

19 8 29 42 48 88 72 65 95 59 82 68
0(p) 1(R) 2(L) 3 4 5 6 7 8 9 10 11
 Step 3.6 R<L so swap between a[p] and a[r]
8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5 6 7 8 9 10 11

Step 4: in the left hand side of 19 , there is a single element. i.e already sorted

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5 6 7 8 9 10 11

Step 5:in the right hand side of 19 , there is a single element. i.e already sorted

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5 6 7 8 9 10 11

Step 6

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5(P) 6(L) 7 8 9 10 11(R)

Step 6.1 .1

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5(P) 6 7(L) 8 9 10 11(R)

Step 6.1.2

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5(P) 6 7 8(L) 9 10 11(R)

Step 6.2.1

8 19 29 42 48 88 72 65 95 59 82 68
0 1 2 3 4 5(P) 6 7 8(L) 9 10 11(R)

Step 6.3 L<R swap in between a[R] and a[L]

8 19 29 42 48 88 72 65 68 59 82 95
0 1 2 3 4 5(P) 6 7 8(L) 9 10 11(R)

Step 6.4 .1

8 19 29 42 48 88 72 65 68 59 82 95
0 1 2 3 4 5(P) 6 7 8 9(L) 10 11(R)
 Step 6.4.2

8 19 29 42 48 88 72 65 68 59 82 95
0 1 2 3 4 5(P) 6 7 8 9 10(L) 11(R)

Step 6.4.3

8 19 29 42 48 88 72 65 68 59 82 95
0 1 2 3 4 5(P) 6 7 8 9 10 11(R)(L)

Step 6.5.1

8 19 29 42 48 88 72 65 68 59 82 95
0 1 2 3 4 5(P) 6 7 8 9 10(R) 11(L)

Step 6.6 R<L so swap between a[p] and a[r]

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 7

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6(L) 7 8 9(R) 10 11

Step 7.1

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6 7(L) 8 9(R) 10 11

Step 7.1.2

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6 7 8(L) 9(R) 10 11

Step 7.1.3

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6 7 8 9(R)(L) 10 11

Step 7.1.4

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6 7 8 9(R) 10(L) 11
 Step 7.2.1

8 19 29 42 48 82 72 65 68 59 88 95
0 1 2 3 4 5(P) 6 7 8 9(R) 10 11

Step 7.3 R<L so swap between a[p] and a[r]

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 8

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5(P) 6(L) 7 8(R) 9 10 11

Step 8.1.1

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5(P) 6(L) 7 8(R) 9 10 11

Step 8.2.1

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5(P) 6(L) 7(R) 8 9 10 11

Step 8.2.2

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5(P) 6(L)(R) 7 8 9 10 11

Step 8.2.3

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5(P)(R) 6(L) 7 8 9 10 11

Step 8.3: now R<L so swap between a[p] and a[r]

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 9

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5 6(P) 7(L) 8(R) 9 10 11
Step 9.1.1
8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5 6(P) 7 8(R)(L) 9 10 11

Step 9.1.2

8 19 29 42 48 59 72 65 68 82 88 95
0 1 2 3 4 5 6(P) 7 8(R) 9(L) 10 11

Step 9.2 now R<L so swap between a[p] and a[r]

8 19 29 42 48 59 68 65 72 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 10

8 19 29 42 48 59 68 65 72 82 88 95
0 1 2 3 4 5 6(P) 7(L)(R) 8 9 10 11

Step 10.1.1

8 19 29 42 48 59 68 65 72 82 88 95
0 1 2 3 4 5 6(P) 7(R) 8 (L) 9 10 11

Step 10.2 now R<L so swap between a[p] and a[r]

8 19 29 42 48 59 65 68 72 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 11. In the left hand side of 68 there is only one element

8 19 29 42 48 59 65 68 72 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11

Step 12 In the right hand side of 88 there is only one element

8 19 29 42 48 59 65 68 72 82 88 95
0 1 2 3 4 5 6 7 8 9 10 11