#include <iostream>
#include <iomanip>

using namespace std;

typedef double ItemT;

const int MAX_NUMBERS = 10;
const ItemT MIN_VALUE = -100;
const ItemT MAX_VALUE = 100;

void FillArray(ItemT values[]);
void PrintArray(const ItemT values[]);
void SortArray(ItemT values[], size_t size);

int main() {
    ItemT values[MAX_NUMBERS];

    srand48(time(nullptr));

    FillArray(values);

    cout << "The unsorted array is " << endl;
    PrintArray(values);

    SortArray(values, MAX_NUMBERS);

    cout << "The sorted array is " << endl;
    PrintArray(values);

    return 0;

}

void FillArray(ItemT values[]){
    size_t i;
    
    for(i=0;i<MAX_NUMBERS;i++) {
        values[i] = MIN_VALUE + drand48()*(MAX_VALUE-MIN_VALUE);
    }
    return;
}

void PrintArray(const ItemT values[]){
     size_t i;

     cout << values[0];
     for(i=1;i<MAX_NUMBERS; i++) {
        cout << ", " << values[i];
     }
     cout << endl;

     return;
}

void Swap(ItemT & a, ItemT & b) {
    ItemT tmp;
    tmp = a;
    a = b;
    b = tmp;
    return;
}

void SortArray(ItemT values[], size_t size) {
     size_t start, current, smallest;

     for(start = 0; start < size-1; start++) {
        smallest = start;
	for(current = start+1; current < size; current ++) {
	   if (values[current] < values[smallest]) {
	       smallest = current;
	   }
	}

	if (smallest != start) {
	   Swap(values[smallest],values[start]);
	}
     }

     return;
}