problem 1) Compute the frequency of every word appearing in article (not including punctuation marks, space and special characters).
Output the k most frequently occurring words along with each frequency, place of this word it appears at the first time , and execution time.
Don’t use STL. Implement entire program by yourself.
The algorithm is not limited but should be implemented with “array.”
Tip: You could use time.h function or unix command to compute the execution time.
Sorting is not required in this assignment. If required, you could use any kind of algorithm to sort. (Hint : It might not be faster to use sorting.)
The “words” are composed of English alphabet and numbers.
Input (File) An article. Each word is separated by space, punctuation marks or new line.
Execution Process: File_name.txt, k
Output(Standard output) : Output k lines of the k most frequently occuring words along with each frequency in order. Ex: (the,4,7). Every pair is separated by new line. And output the execution time.
Capital letter and small letter are the same.
The same frequency is considered the same rank. Must output the k most frequency occuring words.