comp.lang.ada
 help / color / mirror / Atom feed
* Technique Question!
@ 1999-04-03  0:00 Mark
  1999-04-03  0:00 ` Ehud Lamm
  0 siblings, 1 reply; 2+ messages in thread
From: Mark @ 1999-04-03  0:00 UTC (permalink / raw)


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?





^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~1999-04-03  0:00 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1999-04-03  0:00 Technique Question! Mark
1999-04-03  0:00 ` Ehud Lamm

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox