-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksortVector.c
95 lines (76 loc) · 1.89 KB
/
quicksortVector.c
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
void quickSort(int vetor[], int first, int last);
int main(void) {
int vectorSize = 0;
int i = 0;
int space = 20;
clock_t s,f;
printf("Informe o tamanho do vetor: ");
scanf("%i", &vectorSize);
int vetor[vectorSize];
srand(time(NULL));
for(i=0; i<vectorSize; i++) {
vetor[i] = rand()%100;
}
printf("\n");
printf("Vetor Aleatorio: {");
for(i=0; i<vectorSize; i++) {
if(i == 0) {
} else if (i%30 == 0) {
printf("\n");
printf(" ");
}
if(i == vectorSize-1) {
printf("%-1i}", vetor[i]);
} else {
printf("%-1i, ", vetor[i]);
}
}
printf("\n");
s = clock();
quickSort(vetor, 0, vectorSize-1);
f = clock();
printf("\n");
printf("Vetor Ordenado: {");
for(i=0; i<vectorSize; i++) {
if(i == 0) {
} else if (i%30 == 0) {
printf("\n");
printf(" ");
}
if(i == vectorSize-1) {
printf("%-1i}", vetor[i]);
} else {
printf("%-1i, ", vetor[i]);
}
}
float t = (f-s)*1000/CLOCKS_PER_SEC;
printf("\nTempo: %.2f\n", t);
return 0;
}
void quickSort(int vetor[], int first, int last) {
int pivot,j,temp,i;
if(first<last) {
pivot=first;
i=first;
j=last;
while(i<j) {
while(vetor[i]<=vetor[pivot]&&i<last)
i++;
while(vetor[j]>vetor[pivot])
j--;
if(i<j){
temp=vetor[i];
vetor[i]=vetor[j];
vetor[j]=temp;
}
}
temp=vetor[pivot];
vetor[pivot]=vetor[j];
vetor[j]=temp;
quickSort(vetor,first,j-1);
quickSort(vetor,j+1,last);
}
}