Ordenamiento Inserción

/*
                METODO DE INSERCION
*/

#include<iostream>

using namespace std;

void imprimir(int vector[], int);
void imprimirDescendente(int vector[], int);

int main()
{
    const int n = 10;
    int vector[n] = {1,10,2,7,3,9,5,8,6,4};

    imprimir(vector,n);

    // Ordenar
    int aux = 0;
    int pos = 0;

    for(int i=0 ; i<n ; i++){
        pos = i;
        aux = vector[i];


        while((pos>0) && (aux < vector[pos-1])){
            vector[pos] = vector[pos-1];
            pos--;
        }

        vector[pos] = aux;
    }


    cout<<"\n Orden Ascendente: ";imprimir(vector,n);
    cout<<"\n Orden Descendente: ";imprimirDescendente(vector,n);
}


void imprimir(int vector[], int n)
{
    cout<<"[ ";
    for(int i=0 ; i<n ; i++){
        cout<<vector[i]<<" ";
    }
    cout<<"]"<<endl;
}

void imprimirDescendente(int vector[], int n)
{
    cout<<"[ ";
    for(int i=n ; i>0 ; i--){
        cout<<vector[i-1]<<" ";
    }
    cout<<"]"<<endl;
}