In given text file, print the words with their frequency. Now print the kth word in term of frequency.

a) First solution may be you can use the sorting and return the kth element.

b) Second solution: You can use the kth element quick select algorithm.

c) Third solution: You can use Hashtable or Trie to keep track of the frequency. Use Heap to get the Kth element.

//Sorts a given list by selection sort //Input: An array A[0..n-1] of orderable elements. //Output: List A[0..n-1] sorted in ascending order Algorithm SelectionSort (A[0..n-1]) for i=0 to n - 2 do min = i for j =i + 1 to n - 1 do if A[j] A[min] min = j swap A[i] and A[min]