It means that the Borders of the mavximum rectangle should hav all 1s
irrespective the elements inside the rectangles , it can be either 0
or 1 .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
It means that the Borders of the mavximum rectangle should hav all 1s
irrespective the elements inside the rectangles , it can be either 0
or 1 .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
In K way Merging , we implement Heap sort . You can go through the
link
http://www.site.uottawa.ca/~nat/Courses/DFS-Course/DFS-Lecture-9/tsld021.htm
Tournament tree also uses Heap . For it's implementation we need
sorted set of arrays and need to precalcuate the height of the
tournament tree .
