2 2 votes I think the options given for this questions are incorrect, i thing answer would be nk log nk, please correct me if i'm wrong. Algorithms time-complexity algorithm-design virtual-gate-test-series + – Aman Bisht 1 733 views answer comment Share Follow Print See 1 comment 1 1 comment reply Rishabh Gupta 2 commented Oct 7, 2017 reply Follow flag Please don't ask test series questions directly. Instead just ask what your doubt is. Asking test series question is not good for those who have to give the test in future. 4 4 replyShare Please log in or register to add a comment.
1 1 vote Build a Min Heap in $O(K)$. Heapify in $(NK-K) log K = O(NK logK)$ Kapil answered Oct 7, 2017 Kapil comment Share Follow 0 reply Please log in or register to add a comment.
