/*****************************************************************************
*       Creates an array of random ints, sorts them, in ascending order      *
*       using the bubble sort, and searchs in that array for a random number.*
*       Inputed: <none>                                                      *
*       Outputed: mainarray, search_int                                      *
*       Written: August 06, 2002                                             *
*       By: Ronald Roberts                                                   *
*****************************************************************************/

/*  ****************NOTE****************
	THE SEQ SEARCH ALGORITHM HAS
	BEEN RENAMED TO "SEQUENTIAL_SEARCH_0"
	BECAUSE OF A NAMING CONFILCT WITH 
	A BUILT IN FUNCTION DEFINITION.
	************************************
*/

/* Compiler Directives */
#include <iostream.h>
#include <iomanip.h>
#include <math.h>
#include <Stdlib.h>
#include <time.h>

/* Bubble Sort Algorithm */
void bubble_sort_ascending (int array[], int arrayLength);
void bubble_sort_ascending (int array[], int arrayLength)
	{
		int i, j, flag=1;
		int temp;
		for (i=1; (i<=arrayLength) && flag; i++)
			{
				flag =0;
				for (j=0; j< (arrayLength - i); j++)
					{
						if (array[j+1] < array [j])
							{
								temp=array[j+1];
								array[j+1]=array[j];
								array[j]=temp;
								flag=1;
							}
					}
			}			
	}
	
/* Random Number Function */
double randomfunction(int modulator, double shifter);
double randomfunction(int modulator, double shifter)
	{
		return rand()%modulator+shifter;
	}
	
	
/* Sequential Search Algorithm */
int sequential_search_0(int x[], int search_num);
int sequential_search_0(int x[], int search_num)
	{
		int index=0;
		while((index<21) && (search_num != x[index]))
			{
				if (x[index] != search_num)
				{
					index++;
				}
			}
		return (index);
	}
	
	

/* Main Code */
int main()
	{	
		const int array_num=20;
		int mainarray[array_num]={0}, flag=0, search_int=0;
		srand((unsigned)time(NULL));
		cout<<"Array: ";
		for (int i=0; i<array_num; i++)
			{
				mainarray[i]=randomfunction(50, 1);
				cout<<mainarray[i]<<" ";
			}
		bubble_sort_ascending(mainarray, 20);
		cout<<endl<<"Ordered Array: ";
		for (int i=0; i<array_num; i++)
			{
				cout<<mainarray[i]<<" ";
			}
		search_int=randomfunction(50, 1);
		cout<<endl<<"Search Number: "<<search_int<<endl;
		if (sequential_search_0(mainarray, search_int) == 21)
			{ 
				cout<<"The search number "<<search_int<<" is not located in the array."<<endl;
			}
		else
			{
				cout<<"The search number "<<search_int<<" is located in the array."<<endl;
			}
		return 0;
	}
		
/* Results */
/*
Array: 33 31 41 29 36 35 15 26 12 38 30 35 9 32 11 27 36 20 22 28 
Ordered Array: 9 11 12 15 20 22 26 27 28 29 30 31 32 33 35 35 36 36 38 41 
Search Number: 34
The search number 34 is not located in the array.
*/