Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- using namespace std;
- double mean(vector<double>);
- double median(vector<double>);
- vector<double> iSort(vector<double>);
- int main() {
- vector<double> nums;
- while(true) {
- double num;
- cout << "Enter a number. (Input -1 to stop.)\n> ";
- cin >> num;
- if (num == -1) {
- break;
- } else {
- nums.push_back(num);
- }
- }
- nums = iSort(nums);
- double avg = mean(nums);
- double med = median(nums);
- cout << "Mean: " << avg << endl;
- cout << "Median: " << med << endl;
- }
- double mean(vector<double> nums) {
- double amount = nums.size();
- double total;
- for (int i = 0;i < amount;i++) {
- total += nums[i];
- }
- return total/amount;
- }
- double median(vector<double> nums) {
- int middle = nums.size()/2;
- if (nums.size() % 2 == 0) {
- //Is somewhere between
- double ans = (nums[middle] + nums[middle-1])/2;
- return ans;
- } else {
- //Returns the actual middle
- return nums[middle];
- }
- }
- //insertion sort
- vector<double> iSort(vector<double> integers) {
- int siz = integers.size();
- int current, j;
- for (int i = 1; i < siz; i++) {
- current = integers[i];
- j = i-1;
- while (j >= 0 && integers[j] > current) {
- integers[j+1] = integers[j];
- j = j-1;
- }
- integers[j+1] = current;
- }
- return integers;
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement