mirror of
https://github.com/Manoj-HV30/dsa-competitive-programming.git
synced 2026-05-16 19:35:22 +00:00
6 lines
311 B
Markdown
6 lines
311 B
Markdown
The brute force approach is quite intuitive but doesnt meet the specified Run time complexity of O(log(m+n)) instead takes O((m+n)log(m+n)) taken by sorting
|
|
|
|
TwoPointer method takes O(n+m) where we only merge till half and then extract the median which is the middle element
|
|
|
|
Yet to learn binarySearch approach
|