#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define TAM 8
int selectSort(int *vetor) {
    int me, aux, i, troca;
    for(aux=0; aux < TAM-1; aux++) {
        me = aux;
        for (i=aux+1; i < TAM; i++) {
            if (vetor[i] < vetor[me]) {
                me = i;
            }
        }

        if (me != aux)	{
            troca = vetor[aux];
            vetor[aux] = vetor[me];
            vetor[me] = troca;
        }
    }
    return (0);
}
int selectFind(int vetor[], int me, int ma, int k);
int main() {
	//int pegaK;
	int aux;
	int vetor[TAM] = {7, 1, 3, 10, 17, 2, 21, 9};
	int maior = 0, menor = 0;
    //srand (time(NULL));
    //printf("\nK:\n");
    //scanf("%d", &pegaK);
    /*for (aux=0; aux < TAM; aux++) {
        vetor[aux] = (rand() % 89) + 10;
        printf("[%d] ", vetor[aux]);
    }*/
    printf("\n\n");
    for (aux=0; aux < TAM; aux++) {
        printf("[%d] ", vetor[aux]);
    }
    printf("\n\n");
    selectSort(vetor);
    for (aux=0; aux < TAM; aux++) {
        printf("[%d] ", vetor[aux]);
    }
    printf("\n\n");
    printf("%d", selectFind(vetor, 0, 7, 5));
    printf("\n\n");
    return (0);
}