blob: 3d261db9b1f1822c40d8cba1451613e2014291c2 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
#include <stdio.h>
#include <stdlib.h>
int ve = 0;
void quick_sort(int *v, int inicio, int fim){
if(inicio >= fim) return;
int posPivot = (inicio+fim)/2;
int pivot = v[posPivot];
int sp = inicio;
int sv = fim;
while(sp != sv){
ve++;
if(sp < posPivot){
if(v[sp] > pivot){
v[posPivot] = v[sp];
posPivot = sp;
}else{
sp++;
}
}else if(sv > posPivot){
if(v[sv] < pivot){
v[posPivot] = v[sv];
posPivot = sv;
}else{
sv--;
}
}
}
v[sv] = pivot;
quick_sort(v, inicio, sv-1);
quick_sort(v, sv+1, fim);
}
int main(){
int v[3] = {7,4,2};
for(int i = 0; i < 3; ++i) printf("%d ", v[i]);
printf("\n");
quick_sort(v, 0, 2);
for(int i = 0; i < 3; ++i) printf("%d ", v[i]);
printf("\n");
printf("%d\n", ve);
return 0;
}
|
