July 6, 2008 07:26pm pdt

1. Infinity08 300,394
2. evilrix 147,445
3. jkr 90,205
4. ozo 63,055
5. sunnycoder 61,820
6. josgood 34,437
7. Kdo 30,000
8. itsmeand... 29,587
9. jaime_ol... 29,260
10. fridom 25,953
11. Gurudenis 11,630
12. duncan_roe 9,650
13. ravenpl 7,690
14. JohnGaby 7,500
15. PaulCaswell 6,412

1. sunnycoder 848,363
2. Infinity08 833,253
3. Kdo 756,498
4. jkr 700,967
5. ozo 405,363
6. PaulCaswell 296,971
7. grg99 296,356
8. jaime_ol... 184,932
9. brettmjo... 182,528
10. evilrix 177,310
11. itsmeand... 158,053
12. ankuratvb 157,866
13. fridom 156,557
14. imladris 138,967
15. cwwkie 129,383

05.01.2008 at 05:07PM PDT, ID: 23370460

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

5.8

making it faster and faster? how?

Zones: C Programming Language, Programming Languages, Algorithms

So 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?

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:

           
           
             /* Construct a dictionary of words.  When you create it, you may request
** the dictionary keep the dictionary in sorted order (or not) for
** iteration **/
typedef enum { UNSORTED_ORDER, SORTED_ORDER } sorted_e;
Words* DictionaryConstruct (sorted_e sorted);
 
 
 
Words* DictionaryConstruct (sorted_e sorted)
{
  /* TODO:  Don't use the the sorted_e ... should we ?  Right now
  ** we always keep everything sorted, but we can make things
  ** faster if we don't have to keep them sorted... */
  if (sorted==UNSORTED_ORDER) {
    /* ?? */
  } 
 
  Words* dummy = (Words*) malloc(sizeof(Words));
  dummy->next = 0;
  dummy->word = 0;
  dummy->count = -1;  /* Value to show we are at dummy node */
  return dummy;
}

           
         

Start your free trial to view this solution

Question Stats

Zone: Programming

Question Asked By: kinghalls

Solution Provided By: evilrix

Participating Experts: 5

Solution Grade: B

Translate:

Loading Advertisement...