Number Game Algorithm
Problem Link – http://www.iarcs.org.in/inoi/2011/zco2011/zco2011-1b.php
Round Table – Minimum Cost Algorithm
Problem Link – http://www.iarcs.org.in/zco2013/index.php/problems/ROUNDTABLE
Round Table – Minimum Cost Algorithm
Problem Link – http://www.iarcs.org.in/zco2013/index.php/problems/ROUNDTABLE
Assignment of roles in communication when sides could try to cheat
Assume two nodes in a peer-to-peer network initiating a communication.
Why create a Huffman tree per character instead of a Node?
For a school assignment we’re supposed to make a Java implementation of a compressor/decompresser using Huffman’s algorithm.
Does it matter the direction of a Huffman’s tree child node?
So, I’m on my quest about creating a Java implementation of Huffman’s algorithm for compressing/decompressing files (as you might know, ever since Why create a Huffman tree per character instead of a Node?) for a school assignment.
About insertion sort and especially why it’s said that copy is much faster than swap?
From Lafore’s “Data Structures and Algorithms in Java”:
(about insertion sort (which uses copy + shift instead of swap (used in bubble and selection sort)))
How to discriminate from two nodes with identical frequencies in a Huffman’s tree?
Still on my quest to compress/decompress files with a Java implementation of Huffman’s coding (http://en.wikipedia.org/wiki/Huffman_coding) for a school assignment.
Looking for a non-cryptographic hash function that returns a single character
Suppose I have a dictionary of ASCII words stored in uppercase. I also want to save those words into separate files so that the total word count of each file is approximately the same. By simply looking at the word I need to know which file it should be in (if it’s there at all). Duplicate words should go into the same file and overwrite the last one.
How should I compress a file with multiple bytes that are the same with Huffman coding?
On my great quest for compressing/decompressing files with a Java implementation of Huffman coding (http://en.wikipedia.org/wiki/Huffman_coding) for a school assignment, I am now at the point of building a list of prefix codes. Such codes are used when decompressing a file. Basically, the code is made of zeroes and ones, that are used to follow a path in a Huffman tree (left or right) for, ultimately, finding a byte.