sortiranje (nedovršeno)

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <Windows.h>
#define N (10000)

int Switch(int, int, int);
int GetMin(int, int);
int FindAndInsert();
int CopyArray();
int ExchangeSort(int);
int BubbleSort(int);
int SelectionSort(int);
//int InsertionSort(int);

int main()
{
    int i, j;
    int niz[N];
    int min;
    int randNum;

    srand((unsigned)time(NULL));

    for (i = 0; i < N; i++)
    {
        randNum = rand();
        niz[i] = rand;
    }

    printf("Vrijeme potrebno za exchange sort: %d\n", ExchangeSort(&niz));
    printf("Vrijeme potrebno za bubble sort: %d\n", BubbleSort(&niz));
    printf("Vrijeme potrebno za selection sort: %d\n", SelectionSort(&niz));
    //InsertionSort(niz);

    return 0;
}

int ExchangeSort(int *niz)
{
    int i, j, t1, t2, t;
    t1 = GetTickCount();

    for (i = 0; i < N - 1; i++) {
        for (j = i + 1; j < N; j++) {
            if (niz[j] < niz[i]) {
                Switch(&niz, i, j);
            }
        }
    }

    t2 = GetTickCount();
    t = t2 - t1;
    return t;
}

int BubbleSort(int *niz)
{
    int i, j, t1, t2, t;
    t1 = GetTickCount();

    for (i = 0; i < N - 1; i++) {
        for (j = N - 1; j > i; j--) {
            if (niz[j - 1] > niz[j]) {
                Switch(&niz, j - 1, j);
            }
        }
    }

    t2 = GetTickCount();
    t = t2 - t1;
    return t;
}

int SelectionSort(int *niz)
{
    int i, j, min, t1, t2, t;
    t1 = GetTickCount();

    for (i = 0; i < N - 1; i++) {
        min = i;
        for (j = i + 1; j < N; j++) {
            if (niz[j] < niz[i]) {
                min = j;
            }
        }
        Switch(&niz, min, i);
    }

    t2 = GetTickCount();
    t = t2 - t1;
    return t;
}

int InsertionSort(int *niz)
{
    int i, j;

    for (i = 1; i < N; i++) {
        FindAndInsert(&niz, niz[i], i - 1);
    }
    return 0;
}

int Switch(int *niz, int i, int j)
{
    int temp;
    temp = niz[i];
    niz[i] = niz[j];
    niz[j] = temp;

    return niz;
}

int GetMin(int *niz, int i)
{
    int min = niz[i];
    for (i = 0; i < N; i++) {
        if (niz[i] > min) {
            min = niz[i];
        }
    }

    return min;
}

int FindAndInsert(int *niz, int clan, int prijasnji)
{


    return niz;
}

int CopyArray()
{

}