I see a scope of optimization in the algo. In step 2. Before inserting the element a[i][j], you can make sure that a[i][j-1] and a[i-1][j] are in the set. If not then do no insert a[i][j] in the heap. (considering the boundary condition, if j-1 < 0 or i-1 < 0 then assume it is true)
Correct me if I am wrong. On Tue, Feb 8, 2011 at 11:40 PM, algoseeker <[email protected]> wrote: > Just coded the solution, it worked on all the test cases described here in > this thread using the algo i described above :) > > The code is available at > https://github.com/algoseeker/Interview/tree/master/sorting > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
