Median of two sorted arrays (Part-2) | O (log(m,n)) | FREE DSA Course in JAVA | Lecture 58
This question has been asked in product-based Companies like Amazon, VMware, Google, and Microsoft.
The question reads - Find the Median of two sorted arrays with O(log(m,n)) Time complexity.
In the previous lecture, we solve this question with linear time complexity but in this question, we have to solve it with O log (m,n) complexity.
To find the median of two sorted arrays we must combine them into one single array with a good approach.
But in this method, we will compromise with the time complexity given.
So one thing which is very clear is that we have to use the binary search algorithm for this program.
Let's see how combining two arrays into one array approach with little changes can give the desired results as asked in this program.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Algorithms Full Course...
For more information, fill this form: https://forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: https://www.thetapacademy.com
#dsa #datastructures #algorithms #java #programming #coding #coder