Task: Implement O(n) Median Finding Algorithm

Task: Implement O(n) Median Finding Algorithm: a task in Terminal-Lego-15k (Harbor dataset). Finding the median of an unsorted array is a classic algorithmic problem. A naive approach using sorting or heap-based methods achieves O(n log n) time complexity. However, there exists a more efficient…