Sorting Words w/ Linked List & Skipping Punctuation - Help Needed

[brad sue]

Hi,
I have two problems:
please can someone give me an algorithm that would help me to understand how to put words ( read from a file) in alphabetical order using a linked list. I just don't get it!

Also, The words that I need to input is a real text.
but There is punctuation (",", "!",".") that I need to skip in order to continue inputting words.
I know that I can do

 fscanf(fptr,"  [^,], ", words)

to skip the comma. but how can I do all the 3 punctuations in once?

Thank you for your help
B.

 

[dduardo]

1) There are a lot of ways you can do this.

a) You can read everything into a linked list and then sort
b) You can use a bucket approach. Stick words in an appropriate bucket based on the first letter of the word, then sort each bucket and combine.
c) You can use a tree approach. Same as bucket approach, but you can have a linked list of sub-buckets. You'll be sorting on the fly with this method. All you have to do at the end is combine.

Which one do you want to do?

2) Isn't it just:

"%[^,!.]s"

You're modifing the string to exlude ',', '!', and '.'

 

[ravenprp]

Hi B,
Sorting words in alphabetical order using a linked list can be achieved through a simple algorithm. Here are the steps:

1. Create an empty linked list to store the words.
2. Read the words from the file one by one.
3. For each word, check if it is already present in the linked list. If yes, then ignore it. If no, then insert it in the correct position according to its alphabetical order.
4. Once all the words are inserted, the linked list will contain all the words in alphabetical order.

To handle the punctuation, you can use a conditional statement within your loop where you are reading the words. For example, if the current character is a punctuation mark, then skip it and continue reading the next character until you encounter a letter or a number. Once you have the complete word without any punctuation, you can insert it in the linked list using the above algorithm.

I hope this helps. Good luck with your project!