#include <iostream>
#include <stdlib.h>

using namespace std;
const int jdata=1024;

int data[jdata];
int sdata[jdata];

void min(int *data,int &index, int &value){
    index=0; value=data[index];
    for (int i=1; i<jdata; i++)
        if (value>data[i]) {
            value = data[i];
            index =i;
        }
}

void max(int *data,int &index, int &value){
    index=0; value=data[index];
    for (int i=1; i<jdata; i++)
        if (value<data[i]) {
            value = data[i];
            index =i;
        }
}

void selectionsort(int *data, int *sdata, bool asc){
    int index, value;
    for (int i=0; i<jdata; i++){
        if (asc){
            min(data,index, value);
            sdata[i]=value; data[index]=100000000;
        } else {
            max(data,index, value);
            sdata[i]=value; data[index]=-100000000;
        }
    }
}

void optimizedselectionsort(int *data, bool asc){
    int temp;
    for (int i=0; i<jdata-1; i++){
        for (int j=i+1; j<jdata; j++){
            if (asc){
                if (data[i] < data[j]){
                    temp = data[j]; data[j]=data[i]; data[i]=temp;
                }
            else {
                if (data[i] > data[j]){
                    temp = data[j]; data[j]=data[i]; data[i]=temp;
                }
            }
        }
        }
    }
    for (int i=0; i<jdata; i++) cout << data[i] <<endl;
}


void bubblesort(int *data, bool asc){
    int temp;
    for (int i=jdata-1; i>1; i--){
        for (int j=0; j<i; j++){
            if (asc){
                if (data[j]>data[j+1]){
                    temp=data[j]; data[j]=data[j+1];data[j+1]=temp;
                }
            } else {
                if (data[j]<data[j+1]){
                    temp=data[j]; data[j]=data[j+1];data[j+1]=temp;
                }
            }
        }
    }
}

void quicksortiterative(int *data, bool asc){

}

void quicksortrecursive(int *data, bool asc){

}



int main(){
    for (int i=0; i<jdata; i++) data[i]=random()%100;

    //testing maximum minimum
    //for (int i=0; i<jdata; i++) cout << data[i] <<endl;
    //int val,index;
    //max(data,val,index);
    //cout << "min :" << val << "  index:" << index <<endl;
    //min(data,val,index);
    //cout << "min :" << val << "  index:" << index <<endl;

    //testing selection sort
    for (int i=1024-32; i<jdata; i++) cout << data[i] <<endl;
    selectionsort(data,sdata,true);
    cout <<endl;
    for (int i=1024-32; i<jdata; i++) cout << sdata[i] <<endl;

    //testing optimizwd selection sort
    //for (int i=0; i<jdata; i++) cout << data[i] <<endl;
    //cout <<endl;
    //optimizedselectionsort(data,false);
    //cout <<endl;
    //for (int i=0; i<jdata; i++) cout << data[i] <<endl;

    //testing bubble sort
    //for (int i=0; i<jdata; i++) cout << data[i] <<endl;
    //bubblesort(data,true);
    //cout <<endl;
    //for (int i=0; i<jdata; i++) cout << data[i] <<endl;


}