DataStructure/QuickSort.c at master · Luma-Chen/DataStructure · GitHub

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
#include <stdio.h>

void troca (int *x, int *y)
{
	int aux;
	aux= *x;
	*x= *y;
	*y= aux;
}
void quicksort (int *v, int inf, int sup)
{
	int i, j, chave;
	if (sup- inf< 2)
	{
		if ((sup- inf)== 1)
		{
			if (v[inf]> v[sup])
			{
				troca (&v[inf], &v[sup]);
			}
		}
	}
	else
	{
		i= inf;
		j= sup;
		chave= v[inf];
	while (j> i)
	{
		i++;
		while (v[i]< chave)
		{
			i++;
		}
		while (v[j]> chave)
		{
			j--;
		}
		if (j> i)
		{
			troca (&v[i], &v[j]);
		}
	}
	troca (&v[inf], &v[j]);
	quicksort (v, inf, j- 1);
	quicksort (v, j+ 1, sup);
	}
}
int main ()
{
	int i, inf, sup, *x, *y;
	int v[6]= {1, 4, 6, 2, 3, 5};
	troca (&x, &y);
	inf= 0;
	sup= 5;
	quicksort (v, inf, sup);
	for (i= 0; i< 6; i++)
		printf ("\t%d", v[i]);
	return 0;
}