Getting Started
might find this algorithm used in a maze game to locate the shortest distance
between the start and the finish of the maze.
»
Huffman Encoding: This algorithm is quite famous in computers because it
forms the basis for many data-compression techniques. The algorithm assigns
a code to every unique data entry in a stream of entries, such that the most
commonly used data entry receives the shortest code. For example, the letter
E would normally receive the shortest code when compressing English text,
because you use it more often than any other letter in the alphabet. By
changing the encoding technique, you can compress the text and make it
considerably smaller, reducing transmission time.
Do'stlaringiz bilan baham: |