Kth smallest element in a row-wise and column-wise sorted 2D array

#1

I did not get the lecture
can anyone help me in understanding it, please ??

#2

Hi Anuj,
so what basically ques states that u have a 2d array in which each row and col is sorted
and we are supposed to find the kth smallest element in it… it can be easily done using heaps… refer to my code https://ide.codingblocks.com/s/269351

#3

what will be the complexity of this program ??

#4

it would be O(k Logn)

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.