#include <iostream>
#include <fstream>
#include <time.h>
#include <iomanip>
#include "hw5_head.h"

using namespace std;

int main()

{
		ofstream outFile;
			
        const int n = 1000; //indicates array size
		int list[n]; //integer array for a list
        int avg,avgP,avgN,maximum;
		int value, counts;
		
		randomList(list, n);
        
		showList(list, n);    
		
	
		avgs(list,n,avg,avgP,avgN);

        maximum=max(list,n);

        printList(outFile,list,n,avg,avgP,avgN,maximum);

		cout<<"\nsearch using linear search"<<endl;

		cout<<"List contains: "<<linearSearch(list,n,value)<<endl;
		
		bubbleSort(list,n,counts);

        cout<<"\nAfter bubble sort list elements are: "<<endl;

            for(int i=0;i<n;i++)

            cout<<list[i]<<" ";

 

            cout<<"\n\nsearch using binary search"<<endl;

            cout<<"List contains: "<<(bool)binarySearch(list,n,value)<<endl;

           
            //closing the opened files

         
            outFile.close();

            return 0;

} 
Heade File:
[code]
#include <iostream>
#include <fstream>
#include <time.h>
#include <iomanip>

using namespace std;

#ifndef		HW5_HEAD_H
#define		HW5_HEAD_H

//generates random numbers and fills the array with those random numbers

void randomList(int list[], const int n)

{
	signed seed;
	cout << "Enter a random seed ";
	cin>>seed;
	srand(seed);

	for (int i = 0; i < n; i++)
	{
		list[i] = rand()%1000;
	}
	return;
}

//finds average of positive, negative and all numbers seperately.

void avgs (const int list[ ], const int n, int &avg, int &avgP, int &avgN)
{
	int posNums=0,negNums=0;
	int posSum=0,negSum=0;

            for(int i=0;i<n;i++)
			{
				if(list[i]>0)
					{
						posSum += list[i];
						posNums++;
					}
						else if(list[i]<0)
						{
							negSum += list[i];
							negNums++;
						}                     
			}
			avgP = posSum/posNums;
			avgN = negSum/negNums;
			avg=(avgP+avgN)/2;
}

//finds the maximum value in the list

int max (const int list[], const int n)
{
	int maximum =list[0];
		for(int i=1;i<n;i++)
		{
			if(list[i] >maximum)
				maximum=list[i];
		}
		 return maximum;
}

//prints the list values,averages and maximum into the file

void printList(ofstream & outFile, const int list[], const int n, const int avg, const int avgP, const int avgN, const int max)
{
	outFile<<"List elements are: "<<endl;
	cout<<"List elements are: "<<endl;
	for(int i=0;i<n;i++)
	{
		outFile<<list[i]<<" ";
		cout<<list[i]<<" ";
	}
	outFile<<"\n\nAverage of positive numbers: "<<avgP<<endl;
	cout<<"\n\nAverage of positive numbers: "<<avgP<<endl;
	outFile<<"Average of negitive numbers: "<<avgN<<endl;
	cout<<"Average of negitive numbers: "<<avgN<<endl;
	outFile<<"Average of all numbers: "<<avg<<endl;
	cout<<"Average of all numbers: "<<avg<<endl;
    outFile<<"Maximum is: "<<max<<endl;
    cout<<"Maximum is: "<<max<<endl<<endl;
}

//search for an element using linear search

bool linearSearch(const int list[ ], const int n, const int value)
{
	for(int i=0;i<n;i++)
	{
		if(list[i] == value)
			{
				return true;
			}
	}
		return false;
}

//sorting the list using bubble sort

void bubbleSort(int list[ ], const int n, int & counts)
{

   bool swap;
   int temp;
   int i,j;

   counts=0;

   for (i = 0; i<n; i++)
   {
	   swap = false;
	   for (j = 0; j < n - i - 1; j++)
	   {
		   if (list[j] > list [j+1])
		   {
			   swap = true;

			   temp = list[j];
			   list[j] = list[j+1];
			   list[j+1] = temp;

			   counts++;
		   }
	   }
		   if(!swap)
			   break;
	}
	   return;
}

   

//searching the array using binary serach

bool binarySearch(const int list[ ], const int n, const int value)
{
	int first = 0, last = n - 1, middle, position = -1;         
	bool found = false;       

    while (!found && first <= last)
	{
		middle = (first + last) / 2;     
		if (list[middle] == value)      
		{
			found = true;
			position = middle;
		}
		else if (list[middle] > value)  
			last = middle - 1;
		else
			first = middle + 1;          
	}
	return found;
}
void showList(const int list[], const int n)
{
	cout<<"The list is ..... " <<endl;
	for (int i=0; i<n; i++)
	{
		cout<<setw(8)<<right<<list[i];
		if ((i+1)%1000==0)
			cout<<endl;
	}
	cout<<endl;
}
#endif