Quick Sort [CPP]

Quick sort is a sorting method. This method uses divided and conquer method to sort.

Source Code

#include <iostream> using namespace std; class quick { int a[100], n, i, j; public: void read() { cout<<"Enter the limit: "; cin>>n; cout<<"Enter "<<n<<" Elements: "; for(i=0;i<n;i++) { cin>>a[i]; } quick_sort(0, n); cout<<"Sorted List: "; for(i=0;i<n;i++) { cout<<a[i]<<" "; } cout<<"\n"; } void quick_sort(int f, int l) { int j; if(f<l) { j = partition(f, l); quick_sort(f, j); quick_sort(j+1, l); } } int partition(int f, int l) { int pivot, i, j, tmp; pivot = a[f]; i = f; j = l; while(1) { do { ++i; } while(a[i]<=pivot&&i<=l); do { --j; } while( a[j] > pivot ); if( i >= j ) { break; } swap(i, j); } swap(f, j); return j; } void swap(int i, int j) { int tmp; tmp = a[i]; a[i] = a[j]; a[j] = tmp; } }; int main() { quick q; q.read(); cin.get(); }