Coding Contest!
Just a silly contest between me and my friends to create the shortest string of letters possible including every word of a word list put in. Basicly you select any word in the word list and search the string of letters for it, you’ll find the word.
Right now I’m just working on a sample set of 241,574 words or so.
My program so far can just read the text in and remove words that are contained within other words. [ie. The, Then] The first stage which is the rough loading stage takes about 212 seconds and knocks the word list down to 198,901. If the word list was really large, we need all the memory we can save from the beginning.
The second stage checks through everything and at the moment is still going. On my laptop it’s fairly slow. The fun thing is, it gets faster as it goes along. Words that match are removed entirely, meaning 1 less word to check every time.
And etc. I’m gonna go sleep while it’s processing on my laptop now.