StanislavПодскажите пожалуйста где можно найти данный алгоритм в исходниках, на С# желательно.

а в гугле нету?

Ну такое на шарпе можно изобразить

викиcompute huffman code:
input: message ensemble (set of (message, probability)).
base D.
output: code ensemble (set of (message, code)).
algorithm:
1- sort the message ensemble by decreasing probability.
2- N is the cardinal of the message ensemble (number of different
messages).
3- compute the integer n_0 such as 2<=n_0<=D and (N-n_0)/(D-1) is integer.
4- select the n_0 least probable messages, and assign them each a
digit code.
5- substitute the selected messages by a composite message summing
their probability, and re-order it.
6- while there remains more than one message, do steps thru 8.
7- select D least probable messages, and assign them each a
digit code.
8- substitute the selected messages by a composite message
summing their probability, and re-order it.
9- the code of each message is given by the concatenation of the
code digits of the aggregate they've been put in.

StanislavAntonariy, Winnipuh
Спасибо за помощь.
Наверное придется писать самому...

там же есть на с++, портируйте