I've searched online everywhere and can't seem to find an answer to this. Given a sorted list of frequencies, what is the most efficient algorithm for creating a huffman tree and what would its big O worst case be?
What is the worst case runtime for the most efficient algorithm to build a huffman tree?
426 views Asked by Mikey Chen At
1
There are 1 answers
Related Questions in BIG-O
- Why is the runtime for this O(n)?
- What is the average and worst-case time complexity of my string searching algorithm?
- Complexity in Union of disjointed sets with lists
- Usage of merge in linux sort utility
- How to find big o of dependent loops and recursive functions?
- calculating number of operations in algorithm
- How to differentiate between O(n^2) and O(2^n) in dynamic programming with 2 parameters with memoization?
- Having confusion with calculating Big O complexity
- Write code to match a specific Big-O-Notation
- Error vs time complexity in big-O notation
- Time complexity of simultaneous iteration
- Time complexity for recursive binary search that also prints current subarray
- What's the Time Complexity of two separate inner loops nested in an outer loop?
- String manipulation & algorithmic complexity
- Big O notation of string permutation in Python
Related Questions in HUFFMAN-CODE
- How can one correctly extract Huffman Tree from a dynamic compressed block?
- Is it possible match initial bytes of Deflate compressed data using knowledge of first portion of uncompressed data?
- How to handle the remaining bits in file decompression
- Index Out of Range error when Huffman Coding
- Does the BRCI algorithm work for *all* Huffman Trees?
- How to transfer a String data which starts with "0" to a byte type , and recover it without losing the "0" at the first place?
- How can I read a binary file bit-by-bit?
- How to find the set of binary symbols that can most efficiently compress using Huffman coding?
- huffman table in jpeg decoding
- Iterate through all possible code length distributions for canonical Huffman
- My program writes a string when its supposed to write bytes
- What is the process of counting the frequencies of each character which is then feeded into huffman encoding?
- Why is there a optimal Huffman table in the header of a progressive JPEG image?
- Compute the compression ratio by using Huffman encoding
- Compute the compression ratio for Huffman algorithm
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
If you have the list of ordered frequencies then the basic greedy algorithm runs in linear time. You can't beat that (from an asymptotic perspective) since you have to process each node at least once.