12345678910111213141516171819

# Function to calculate the median of the array
def getMedian(arr, n):
    arr.sort()  # Sort the array to arrange elements in order
    
    if n % 2 == 0:
        # If the array size is even, calculate the average of two middle elements
        ind1 = (n // 2) - 1
        ind2 = (n // 2)
        print((arr[ind1] + arr[ind2]) / 2)  # Return the median for even-sized array
    else:
        # If the array size is odd, return the middle element
        print(arr[n // 2])

# Driver code
arr = [4, 7, 1, 2, 5, 6]
n = 6
print("The median of the array is: ", end="")
getMedian(arr, n)  # Function call to calculate and print the median

123456789101112131415161718192021222324

class Solution {
    // Function to calculate the median of the array
    getMedian(arr, n) {
        arr.sort((a, b) => a - b);  // Sort the array to arrange elements in order
        
        if (n % 2 === 0) {
            // If the array size is even, calculate the average of two middle elements
            let ind1 = (n / 2) - 1;
            let ind2 = (n / 2);
            console.log((arr[ind1] + arr[ind2]) / 2);  // Return the median for even-sized array
        } else {
            // If the array size is odd, return the middle element
            console.log(arr[Math.floor(n / 2)]);
        }
    }
}

// Driver code
let arr = [4, 7, 1, 2, 5, 6];
let n = 6;
let obj = new Solution();
console.log("The median of the array is: ");
obj.getMedian(arr, n);  // Function call to calculate and print the median

Complexity Analysis

Time Complexity: O(N*log N), as sorting of array is involved.

Space Complexity: O(1), no extra space required.