#include "common.h"

void mergesort(int *, int *, uint)
{

    return ;
}

static void partition(int *, uint)
{
    return;
}

void quicksort(int *, uint)
{
    return;
}


int main(int ac, char *av[])
{
    uint n, i;
    int *array, *temp_array;

    if (ac < 3)
        ERR_MESG("Usage: sorting <-q or -m> n1 n2 n3 ...");
    n = ac-2;

    if (NULL == (array = Malloc(n, int)) ||
        NULL == (temp_array = Malloc(n, int)))
        ERR_MESG("sorting: out of memory\n");

    for (i = 0; i < n; i++)
        array[i] = atoi(av[i+2]);

    switch(av[1][2]) {
    case 'm':
        mergesort(array, temp_array, n);
        break;
    case 'q':
        quicksort(array, n);
        break;
    default:
        fprintf(stderr, "Unknown option %s\n", av[1]);
    }

    for (i = 0; i < n; i++)
        printf("%d ", array[i]);

    return 0;
}