Hash vs Trie

Hi,


I'm trying to implement solution to following problem in C:

I have a large text file (apprx 50KB) .Now i want to print the words in descending order according to their frequncies in given file.

Which data structure would be best?? Hash tables or tries..or any other suggestion...

Thanks

faxo

What is your definition of "best" ?
- easiest to implement
- quickest to run
- smallest amount of memory
- gains the most marks in my assignment

I would suggest you try them both (and others), because working out what is "best" is most effectively found out through direct experience.

http://www.nist.gov/dads/

Either of those ideas should work well.