Task: Implement O(log n) Median Finding Algorithm for Two Sorted Arrays

Task: Implement O(log n) Median Finding Algorithm for Two Sorted Arrays: a task in Terminal-Lego-15k (Harbor dataset). Your task is to implement an algorithm that finds the median of two sorted arrays in O(log n) time complexity using binary search concepts.