Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "NumberArray.h"
- #include <iostream>
- #include <cstdlib>
- using namespace std;
- Class1::Class1(int s)
- {
- size = s;
- arr = new double[size];
- }
- double Class1::getNumber(int n)
- {
- return arr[n];
- }
- double Class1::getHighest()
- {
- double highest = -99999;
- for (int counter = 0; counter < size; counter++)
- {
- if (arr[counter] > highest)
- highest = arr[counter];
- }
- return highest;
- }
- double Class1::getLowest()
- {
- double lowest = 99999;
- for (int counter1 = 0; counter1 < size; counter1++)
- {
- if (arr[counter1] < lowest)
- lowest = arr[counter1];
- }
- return lowest;
- }
- double Class1::getAverage()
- {
- double average = 0;
- for (int counter2 = 0; counter2 < size; counter2++)
- {
- average += arr[counter2];
- }
- average = average / size;
- return average;
- }
- void Class1::storeNumber(double store, int slot)
- {
- arr[slot] = store;
- }
Add Comment
Please, Sign In to add comment