You could do it like this 1) Get max length of word list. 2) Create list/array of f_0, f_1, ... f_n where f_i is the ith Fibonacci number, and f_(n+1) is the smallest Fibonacci number greater than the max word length 3) For each f_i, search through the text for words with that length.
You could do it like this
1) Get max length of word list.
2) Create list/array of f_0, f_1, ... f_n where f_i is the ith Fibonacci number, and f_(n+1) is the smallest Fibonacci number greater than the max word length
3) For each f_i, search through the text for words with that length.
(post is archived)