find - storing word by word and finding in java -

I am trying to create a dictionary essay (collecting words and then finding one of them)

For example: Sorting algorithm From Wikipedia, the free encyclopedia A Sorting algorithm is an algorithm that holds elements of a list in a certain order. The most commonly used orders are numerical order and semantic sequence. Skillful sorting is important for optimizing the use of other algorithms (like search and merge algorithms), for which input data must be in sorted lists; It is often useful for making the data canonical and the production of human-readable output. More formally, the output should meet two conditions: the output is in order respectively (each element is not smaller than the previous element according to the desired total order); In addition, the output is the permutation (rerouting) of the input, in addition to that, the data is often taken in an array, which allows random access rather than a list, which only allows sequential access, although often the algorithm can be used for any kind of data Can be implemented with appropriate modification.

I want to store it (above) in an array or something without reading the same word twice and without a word search since then. Whatever I have tried, he is still using [10000] to store something (not big in case) and scanners to read from .txt file, but things too long without it Time (5 minutes + one book (100,000 words), what should I use to not wait for so long (less than 10 minutes)?

Run a menu, then read .txt Ask for:

  integer number = 0; string [] word list = new string C [5000000]; string readfile = keyboard.NXTine (); scanner file = null; file = new scanner (new file (readFile); while (file.hasNextLine ()) {scanner file = new.xl (scanner file.nextLine ); Boolean b; while (b = file.hasNext ()) {wordlist [number] = file.next (); println; num ;+;}}  

After that I can check