From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Technique Question!
Date: 1999/04/03
Date: 1999-04-03T00:00:00+00:00 [thread overview]
Message-ID: <Pine.A41.3.96-heb-2.07.990403174521.107932A-100000@pluto.mscc.huji.ac.il> (raw)
In-Reply-To: 3705A728.97751843@bellatlantic.net
Heap?
Ehud Lamm mslamm@pluto.mscc.huji.ac.il
On Sat, 3 Apr 1999, Mark wrote:
> I'm a student, taking a Data Structures course. I'm currently writing a
> program that produces Huffman Encoding for text input. I'm trying to
> determine the best data structure to utilize for sorting the character
> frequencies. I used a linked-list of records to store 1)character,
> 2)frequency, and 3) marked/unmarked. (with the linked-list sorted
> according to character) From here I intended to populate the binary
> tree, but must first sort according to frequency. I feel that there
> must be a cleaner alternative. Has anyone done this, and if so what did
> you find to be the best approach?
>
>
>
prev parent reply other threads:[~1999-04-03 0:00 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-04-03 0:00 Technique Question! Mark
1999-04-03 0:00 ` Ehud Lamm [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox