Apply quicksort algorithm recursively to the left and the right parts. Notice, that array may be divided in non-equal parts. Karena data 4 dan 5 sudah berada pada urutan yang cocok, maka tidak terjadi pertukaran. Pengurutan dimulai dari lokasi pertama (I adalah 1), dan dibandingkan dengan lokasi sebelahnya (I+1 adalah 2). Disajikan contoh cara kerjanya, untuk 5 buah data yaitu 4, 5, 1, 3, 2. Values equal to the pivot can stay in any part of the array. Seperti gelembung dalam minuman soda, yang perlahan bergerak naik ke atas. Rearrange elements in such a way, that all elements which are lesser than the pivot go to the left part of the array and all elements greater than the pivot, go to the right part of the array. We take the value of the middle element as pivot value, but it can be any value, which is in range of sorted values, even if it doesn't present in the array. AlgorithmThe divide-and-conquer strategy is used in quicksort. The idea of the algorithm is quite simple and once you realize it, you can write quicksort as fast as bubble sort. Problem statement We are given an array, we need to sort it using the concept of quicksort Here we first partition the array and sort the separate partition to get the sorted array. On the average, it has O(n log n) complexity, making quicksort suitable for sorting big data volumes. Quicksort is a fast sorting algorithm, which is used not only for educational purposes, but widely applied in practice. Procedure quicksort(var A:larik aw,ak:integer) Writeln ( 'Hasil data yang telah diurutkan:')

Here I use the tools Borland C ++ 5.02.Writeln (' PENGURUTAN DENGAN METODE QUICK SORT') The following example Simple Program ‘quick sort’. Its sequence is to convert data between the position to greater than x with the data between positions to smaller than x. This pivot j should be placed so that the data between positions to smaller than x, while to greater than x. Ordering is based on the principle of recursion. Contoh Program Pascal Struktur Case program strukturCase var grade: char begin grade: 'A' case (grade) of 'A': writeln('Luar biasa' ) 'B': writeln('Bagus' ) 'C': writeln('Cukup' ) 'D': writeln('Kurang' ) 'F': writeln('Coba Lagi' ) else writeln('Grade (nilai) salah') end end. Quick sort a sequencing techniques that are similar to merge sort, use “divide and conquer”.

Contoh program pascal quicksort