0 votes 0 votes Algorithms binary-heap merging + – Ajeet Singh asked Apr 20, 2018 • retagged Jun 28, 2022 by makhdoom ghaya Ajeet Singh 634 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes To select Min at Each iteration in O(1) time it is best Datastructure suited for this job Shubham Pandey 2 answered Apr 20, 2018 Shubham Pandey 2 comment Share Follow See all 3 Comments See all 3 3 Comments reply srestha commented Apr 20, 2018 reply Follow Share optimal marge means? 0 votes 0 votes akash.dinkar12 commented Apr 20, 2018 reply Follow Share https://gateoverflow.in/180570/optimal-merge-pattern 0 votes 0 votes pankaj_vir commented Apr 20, 2018 reply Follow Share @srestha merging files, so that at every stage we have the least length 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes In optimal merge pattern we Pick always two Minimam element. And min heap is best data structures if we want always Minimam element. Like optimal merge, Huffman coading, kruskal. abhishekmehta4u answered Apr 20, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.