Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- /*void sortarr(int a[], int t)
- {
- int l;
- for (int j=0; j<t; j++)
- {
- for(int k=j+1; k<=t ; k++)
- {
- if(a[j]>a[k])
- {
- l=a[k];
- a[k]=a[j];
- a[j]=l;
- }
- }
- }
- }*/
- void quickSort(int arr[], int left, int right) {
- int i = left, j = right;
- int tmp;
- int pivot = arr[(left + right) / 2];
- /* partition */
- while (i <= j) {
- while (arr[i] < pivot)
- i++;
- while (arr[j] > pivot)
- j--;
- if (i <= j) {
- swap(arr[i], arr[j]);
- i++;
- j--;
- }
- };
- /* recursion */
- if (left < j)
- quickSort(arr, left, j);
- if (i < right)
- quickSort(arr, i, right);
- }
- int main()
- {
- int t;
- int x[50];
- cin >> t;
- for(int i=0;i<t;i++)
- {
- cin >> x[i];
- }
- //sortarr(x,t);
- for(int c=0;c<t;c++)
- {
- cout << x[c] << endl;
- }
- quickSort(x,x[0],x[t-1]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement