I want to implement this.I will read a .txt file and then i will convert it from Big letters to small letters in an other .txt file. Then i have to count them so that i find the most common letters or words .My question is What kind of table should i use for that? Should i use a hash or a map table ?The .txt files has about 5000000 letters words sentences.What is the table i have to use if i want to store compare and count and convert large files,so that i can retrieve it fast.
I have though a hash table
HashMap<String, String> hm = new HashMap<String, String>();
or should i do it with some other way?
Or should i use linked list ?
How can i implement it for Sentences or Words ?
Have a look here http://www.ntu.edu.sg/home/ehchua/programming/java/J5c_Collection.html#zz-2.6
and here http://www.ntu.edu.sg/home/ehchua/programming/java/J5c_Collection.html#zz-4.
and here http://www.javapractices.com/topic/TopicAction.do?Id=65 and the bset in my opinion is here http://www.javamex.com/tutorials/collections/how_to_choose.shtml.
Have fun