Multi-Sort Program #2
   March 2001
   Dave Maynard -- Daxxus
   email -- maynard@cs.fsu.edu (til I graduate in Summer 2001)

There are 3 Sorts Implemented.

It covers Bubble Sort, BiDirectional Bubble Sort, Bitonic Sort.

//////////////
// OUTPUT:: //
//////////////
Upon instantiation the program gives the user a choice of the SIZE of the "Sample Size" to be sorted.
It then gives you the Statistics (SORT TIMING) for each of the sorts.

////////////
// CODE:: //
////////////
The Sample-Size is taken in by standard input then used to dynamically allocate an array of that 
size to be used in the sorting arrays.
The original is filled with generic random data.

The original array is copied into a duplicate Array for each sorting algorithm so that the same 
data can be used in each (keeps the timing valid.)

These dynamic arrays are destroyed when they are done being used.

NOTE::
   Bitonic Samples are totally different because the Sample Size must be in powers of 2.

NOTE::
   The reason the arrays truly needed to be dynamic is to allow for HUGE arrays such as 1,000,000 in size.
   You would get a core dump (Linux-Unix) or a memory crash (Windows) if the arrays were not created this way.

BIG NOTE:: (heh heh...)
   There is a #define DEBUGIT at the top of the code that is commented out.
   If you want to "see" that each algorithm is working properly -- then UN-comment that line.
   It will print out the data to the screen -- using a stepsize (so it doesn't print out the whole thing...)

///////////////////
// Environment:: //
///////////////////
This code can be directly compiled in:
   Visual C++ 6.0. (I hate this compiler...)
   Bloodshed Dev-C++ (I LOVE this compiler...)  A wonderful environment to code in.   
                                                Get it at www.bloodshed.net
   All Linux-Unix Compilers
      
////////////////////////////////////
// Sample Makefile for Linux-Unix //  -- ** MAKE SURE THE INDENTS ARE TABS NOT SPACES ** --
////////////////////////////////////
Label:
	g++ -o Multi-Sort2 Multi-Sort2.cpp