- For individual users
- Instant access to solutions
- Ask your tech questions
- Start your 30-day Free Trial
Main Topics
Browse All TopicsSo I am asked to do a simple task.. I have two file which contains a list of words.. the list of words is extremely huge and one is sorted and one is not.. I have to produce a third file which is the list of words that exists in both files and that produced list must be sorted in alphabetically.. right now the implementation is to sort those files in a linked list which is sorted.. and as we all know this is really really bad..
Here's some of the info, the list of file or we can call it dictionaries as it is a dictionary:
I was thinking of storing both of these files first into a hash table and then compare two similar words and put them in a new output if they are similar..
is there any faster alternative?
This question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
Business Accounts
Answer for Membership