The document describes the quicksort algorithm through pseudocode and diagrams. It shows the steps of quicksort, which are: 1) Choosing a pivot element, 2) Partitioning the array around the pivot by swapping elements less than and greater than the pivot, 3) Recursively applying quicksort to the subarrays divided by the pivot. The document provides an example of quicksorting an array of numbers and visualizes each step of the process.

1. QUICK SORT
Algoritma Pengurutan

2. SIMULASI QUICKSORT

3. RESULT

4. SIMULASI ALGORITMA QUICKSORT

5. QuickSORT(Array, indexawal, indexakhir)
indexawal
indexakhir
data
QuickSORT(data, 1,5)

6. QuickSORT(data, 1, 5)
indexawal
indexakhir
data
STEP 1
IF(indexawal < indexakhir)

7. See Code
Indexhigher
pivot
While index lower < index higher
Indexlower
Cek Lower
Cek Higher
If(indexlower < index higher)
Swap
Swap
QuickSORT(data,
indexawal,
indexhigher-1)
QuickSORT(data,
indexawal,
indexhigher+1)

8. Indexhigher
pivot
Indexlower
While index lower < index higher

9. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

10. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

11. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

12. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

13. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

14. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

15. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

16. Indexhigher
pivot
Indexlower
While index lower < index higher
If(indexlower < index higher)
Swap

17. Indexhigher
pivot
Indexlower
While index lower < index higher
If(indexlower < index higher)
Swap

18. Indexhigher
pivot
Indexlower
While index lower < index higher

19. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

20. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

21. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Lower

22. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

23. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

24. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

25. Indexhigher
pivot
Indexlower
While index lower < index higher
Cek Higher

26. Indexhigher
pivot
Indexlower
While index lower < index higher
If(indexlower < index higher)
Swap

27. Indexhigher
pivot
Indexlower
Swap

28. Indexhigher
pivot
Indexlower
Swap

29. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
Quicksorting(4,5)

30. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher

31. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Lower

32. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Lower

33. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Lower

34. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Lower

35. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Higher

36. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Higher

37. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Higher

38. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
If(indexlower < index higher)
While index lower < index higher
Swap

39. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
Swap

40. pivot
Indexhigher
Indexlower
Quicksorting(1,2)
Quicksorting(1,0)
Quicksorting(2,2)

41. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher

42. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Lower

43. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Lower

44. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Lower

45. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Lower

46. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Lower

47. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
While index lower < index higher
Cek Higher

48. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
While index lower < index higher
Cek Higher

49. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
If(indexlower < index higher)
While index lower < index higher
Swap

50. Indexhigher
pivot
Indexlower
Quicksorting(1,2)
Swap

51. Indexhigher
pivot
Indexlower
Quicksorting(4,5)
Quicksorting(4,4)
Quicksorting(6,5)

52. RESULT

53. TERIMAKASIH

54. C Code for QuickSORT
void quicksort(int arr[max],int arrawal,int arrakhir){
int pivot,indexhigher,temp,indexlower;
if(arrawal<arrakhir){
pivot = arrawal;
indexlower = arrawal;
indexhigher = arrakhir;
while(indexlower<indexhigher){
while((arr[indexlower]<=arr[pivot])&&(indexlower<arrakhir)){
indexlower++;
}
while(arr[indexhigher]>arr[pivot]&&(indexhigher>arrawal)){
indexhigher--;
}
if(indexlower<indexhigher){
swap(arr,indexlower,indexhigher);
}
}
swap(arr,pivot,indexhigher);
quicksort(arr,arrawal,indexhigher-1);
quicksort(arr,indexhigher+1,arrakhir);
}
}//end

55. Swap code
void swap (int a[max], int left, int right){
int temp;
temp=a[left];
a[left]=a[right];
a[right]=temp;
}//end swap

56. Cek Lower
If(data[indexlower] <= data[pivot] && indexlower < indexakhir )
Indexlower = indexlower + 1

57. Cek Higher
If(data[indexhigher] > data[pivot])
Indexhigher = indexhigher + 1