using namespace std;
#include <iostream>
#include <ctime>
#include "stdlib.h"

// Maximum of 1 million numbers to sort.
#define MAX_SIZE 1000000

//function def's
void quicksort(int low, int high, int count);
int random_hoare_partition(int low, int high);
int generate_random_number(int min, int max);
void swap(int &first, int &second);

int array[MAX_SIZE];

main(int argc, char *argv[])
{
  	int i;
	int count = 0;
        char c;

       //seed the generator with the current time
       srand(static_cast<unsigned>(time(0)));

      while (cin >> array[count])
           ++count;


     for (i = 0; i < count; ++i)
        cout << array[i] << endl; 




        cout << "Time to sort!" << endl;
        quicksort(0, count-1, count);

        cout << "We sorted, print out the numbers:" << endl;

        for (i = 0; i < count; ++i)
                cout << array[i] << endl;

}

//PROBLEM HERE OR IN RANDOM_HOARE_PARTITION
void quicksort(int low, int high, int count)
{
        int pivot;
        if(low < high)
        {
                pivot = random_hoare_partition(low, high);
                quicksort(low, pivot, count);
                quicksort(pivot+1, high, count);
        }
}

//PROBLEM HERE OR IN QUICK SORT
int random_hoare_partition(int low, int high)
{
        int pivot;
        int i = low-1;
        int j = high+1;
        bool run = true;
        int index = generate_random_number(low, high);



        pivot = array[index];

        while(run)
        {
                do
                {
                        j = j - 1;
                }
                while (array[j] > pivot);   //find a smaller one
	
		do
                {
                	i = i + 1;
                }
                while(array[i] < pivot);     //find a larger one
		
		if(i < j)
                	swap(array[i], array[j]);
                else
                	return j;


        }

}

//this generates a random number from min to max.
int generate_random_number(int min, int max)
{
        int i;
        int num;

        num  = rand() % (max -min + 1);

        return num;

}

void swap(int &first, int &second)
{
        int temp = first;


        first = second;
        second = temp;


}

#include <iostream>
#include <cstdlib>

using namespace std;

int main()
{
  int generate_random_number(int min, int max);
  int i, j, k;
  int num;
  for (i = 0; i < 10; i++) {
    j = i*10;
    k = i+100;
    num = generate_random_number(j, k);
    cout << "generate_random_number(" << j 
         << ", " << k << ") = " << num << endl;
  }
  return 0;
}

//
//this is supposed to generate a random number from min to max.
//
int generate_random_number(int min, int max)
{
    int num;
    num  = rand() % (max -min + 1);
    return num;
}