[ru] LeetCode - 4. Median of Two Sorted Arrays

Опубликовано: 06 Октябрь 2024
на канале: Developer Circle Moscow

Описание задачи: https://github.com/CrazySquirrel/Outt...
Naive approach: O(n + m + (n + m) * log(n + m)) | O(n + m) - https://github.com/CrazySquirrel/Outt...
Naive approach (Optimized): O(n + m) | O(n + m) - https://github.com/CrazySquirrel/Outt...
Binary search: O(log(min(m,n))) | O(1) - https://github.com/CrazySquirrel/Outt...
Kth element: O(log(min(m,n))) | O(1) - https://github.com/CrazySquirrel/Outt...
Kth element (using indexes): O(log(min(m,n))) | O(1) -https://github.com/CrazySquirrel/Outt...
Kth element (using indexes) (iterative): O(log(min(m,n))) | O(1) -https://github.com/CrazySquirrel/Outt...