//Author: Spencer Hitt //Source File: Proj5code.cpp //Description: The Stock Problem //Compiler used: Visual Studio C++ Express Edition #include using namespace std; void displayPresent(); double findMax(); double findMin(); double calcAvg( double array1[], int count); int SIZE = 20; int SIZE2 = 8; int main() { double stock1[] = {34.25,40.50,36.50,40.00, 30.25,30.25,35.50,36.00, 34.25,37.00,34.00,35.00, 36.25,34.25,40.50,41.50, 41.50,40.00,36.50,34.50}; double stock2[] = {40.25,38.50,34.50,33.50, 30.50,29.75,37.50,36.00, 34.75,38.00,34.25,37.00, 34.25,37.50,34.50,38.50, 37.50,37.25,38.25,37.50}; long double stock3[] = {100.41, 90.45, 99.30, 102.99, 98.54, 95.30, 92.32, 110.88}; cout.setf(ios::fixed); cout.setf(ios::showpoint); cout.precision(2); displayPresent(); cout << "\n Press Enter to continue..." < max1) max1 = stock1[i]; if(stock2[i] > max2) max2 = stock2[i]; } cout << " The maximum number in stock1 = " << max1 <