0 votes 0 votes Question:What is the time complexity of Huffman algorithms when the input is already sorted Algorithms algorithms huffman-code time-complexity descriptive + – Rackson asked Apr 19, 2017 retagged Jun 23, 2022 by Lakshman Bhaiya Rackson 702 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes time complexity will not change in sorted input. In huffman coding we require construction of heap and insertion and deletion in heap. which require total of O(n(logn)) time for n inputs. superask answered Apr 19, 2017 superask comment Share Follow See all 0 reply Please log in or register to add a comment.