Talk:Package-merge algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 12:06, 7 November 2006

I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, Oravec 06:13, 7 November 2006 (UTC)[reply]

I will add the details within 48 hours. I wish to verify the information before adding it. Oravec 06:22, 7 November 2006 (UTC)[reply]

Although some references need to be added, the algorithm is now described. Faster algorithms for the length-limited Huffman coding problem exist, but they are too complicated for practical applications. Vegasprof 12:06, 7 November 2006 (UTC)[reply]

Revision as of 06:22, 7 November 2006 edit Oravec (talk \| contribs) 114 edits added will update within 48 hours ← Previous edit		Revision as of 12:06, 7 November 2006 edit undo Vegasprof (talk \| contribs) 487 edits No edit summary Next edit →
Line 2:		Line 2:

	I will add the details within 48 hours. I wish to verify the information before adding it. [[User:Oravec\|Oravec]] 06:22, 7 November 2006 (UTC)		I will add the details within 48 hours. I wish to verify the information before adding it. [[User:Oravec\|Oravec]] 06:22, 7 November 2006 (UTC)

			Although some references need to be added, the algorithm is now described. Faster algorithms for the length-limited Huffman coding problem exist, but they are too complicated for practical applications. [[User:Vegasprof\|Vegasprof]] 12:06, 7 November 2006 (UTC)