LabCompiladores/sort.txt at master · LeonTenorio/LabCompiladores · 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
int vet[ 10 ];

int minloc ( int a[], int low, int high ){
    int i; int x; int k;
    k = low;
    x = a[low];
    i = low + 1;
    while (i < high){
        if (a[i] < x){
            x = a[i];
            k = i;
        }
		i = i + 1;
	}
    return k;
}

void sort( int a[], int low, int high){
    int i; int k;
    i = low;
    while (i < high-1){
        int t;
        k = minloc(a,i,high);
        t = a[k];
        a[k] = a[i];
        a[i] = t;
        i = i + 1;
    }
}

void main(void){
    int i;
    i = 0;
    while (i < 10){
        vet[i] = 25-i;
        i = i + 1;
    }
    sort(vet,0,10);
    i = 0;
    while (i < 10){
        output(vet[i]);
        i = i + 1;
    }
}