void ascending(stack &S){
    int pass, j, tmp;

    for(pass = 1; pass <= Top(S); pass++){
        for (j = Top(S); j > 0; j--){
            if (info(S)[j] > info(S)[j-1]){
                tmp = info(S)[j];
                info(S)[j] = info(S)[j-1];
                info(S)[j-1] = tmp;
            }
        }
    }
}

void descending(stack &S){
    int pass, j, tmp;

    for(pass = 1; pass <= Top(S); pass++){
        for(j = Top(S); j > 1; j--){
            if(info(S)[j] < info(S)[j-1]){
                tmp = info(S)[j];
                info(S)[j] = info(S)[j-1];
                info(S)[j-1] = tmp;
            }
        }
    }
}