This is a discussion on Hash vs Trie within the C Programming forums, part of the General Programming Boards category; Hi, I'm trying to implement solution to following problem in C: I have a large text file (apprx 50KB) .Now ...
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/
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I support http://www.ukip.org/ as the first necessary step to a free Europe.
Either of those ideas should work well.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
LinkBack URL
About LinkBacks
