Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void quickSort(vector<int> arr, int left, int right) {
- int i = left, j = right;
- int tmp;
- if (arr[left]>arr[left+1]){ /*1 MÉTODO DE ESCOLHA DO PIVÔ*/
- pivot = arr[left];
- }
- else pivot = arr[left+1];
- if (arr[left]>arr[(left + right) / 2]){ /*2 MÉTODO DE ESCOLHA DO PIVÔ*/
- pivot = arr[left];
- }
- else pivot = arr[(left + right) / 2];
- if (arr[left]>arr[(left + right) / 2]){ /*3 MÉTODO DE ESCOLHA DO PIVÔ*/
- pivot = arr[left];
- }
- else pivot = arr[(left + right) / 2];
- while (i <= j) {
- while (arr[i] < pivot)
- i++;
- while (arr[j] > pivot)
- j--;
- if (i <= j) {
- tmp = arr[i];
- arr[i] = arr[j];
- arr[j] = tmp;
- i++;
- j--;
- }
- };
- /* recursion */
- if (left < j)
- quickSort(arr, left, j);
- if (i < right)
- quickSort(arr, i, right);
- cout << endl;
- for (int i=0; i<5; i++){
- cout << arr[i];
- if (i!= (5-1)) cout << "-";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement