Skip to content

Instantly share code, notes, and snippets.

@tolpp
Created February 10, 2015 00:29
Quicksort(A[l..r])
//Alt dizilerin quicksort ile sıralanması
//Input: Dizinin alt dizisi A[0..n − 1]eved
// indices l and r
//Output: Alt dizi A[l..r] artan şekilde sıralı
if l < r
s ← Partition(A[l..r]) //s : bölme pozisyonu
Quicksort(A[l..s − 1])
Quicksort(A[s + 1..r])
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment