Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void quickSort(int *vetor, int inicio, int fim)
- {
- int i, j, meio, aux;
- i = inicio;
- j = fim;
- meio = vetor[(inicio + fim) / 2];
- do
- {
- while(vetor[i] < meio)
- i++;
- while(vetor[j] > meio)
- j--;
- if(i <= j)
- {
- aux = vetor[i];
- vetor[i] = vetor[j];
- vetor[j] = aux;
- i++;
- j--;
- }
- }while(i <= j);
- if(inicio < j)
- quickSort(vetor, inicio, j);
- if(i < fim)
- quickSort(vetor, i, fim);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement