Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void swap(int &a, int &b)
- {
- int temp = a;
- a = b;
- b = temp;
- }
- int pivot_pos(int arr[], int low, int high)
- {
- int pivot = arr[high];
- int i = (low-1)
- for(j = low; j <= high; j++)
- {
- i++;
- if(arr[i]>arr[j])
- {
- swap(arr[i], arr[j]);
- }
- }
- swap(arr[i], arr[high]);
- return (i+1);
- }
- void quicksort(int arr[], int low, int high)
- {
- if (low < high)
- {
- int pi = pivot_pos(arr, low, high);
- quicksort(arr, pi+1, high);
- quicksort(arr, low, pi-1);
- }
- }
- int main()
- {
- int arr[] = {5,23,222,1,21,76,8,5,43,11,56};
- int size = sizeof(arr)/sizeof(arr[0]);
- quicksort(arr, 0, size-1);
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement