How do I calculate the median in C++?

How do I calculate the median in C++?

To calculate the median in C++, you first need to sort the array of numbers. Then, if the number of elements is odd, the median is the middle element; if even, it's the average of the two middle elements.

Can you show me a code example?

Sure! Here's a simple example:

#include <iostream>
#include <vector>
#include <algorithm>

double calculateMedian(std::vector<int>& nums) {
    std::sort(nums.begin(), nums.end());
    int n = nums.size();
    if (n % 2 == 0) {
        return (nums[n/2 - 1] + nums[n/2]) / 2.0;
    } else {
        return nums[n/2];
    }
}

int main() {
    std::vector<int> numbers = {3, 1, 4, 1, 5, 9};
    std::cout << "Median: " << calculateMedian(numbers) << std::endl;
    return 0;
}

This code sorts the numbers and calculates the median.

What if I have a large dataset?

For large datasets, consider using more efficient data structures or algorithms, like a min-heap and max-heap approach, to maintain the median in logarithmic time.

Can you explain that approach?

Certainly! By using two heaps, a max-heap for the lower half and a min-heap for the upper half, you can efficiently balance the two halves and find the median in O(log n) time as you add new numbers.