>>I do not get how to show in ASCII order the words with equal frequency.
To continue the scenario from post #29, once you have the array of uniqueWords you can search allWords to determine the frequency with which each uniqueWord occurs. Rather than printing the uniqueWord and frequency to the screen you can keep a third array, wordFrequency to hold the frequency with which each uniqueWord occurs. The index of each uniqueWord in uniqueWords will be the same index in wordFreuency. Once you have completed the freuqency array you can sort the frequency array by frequency. If you use a bubble sort to sort by frequency every time you swap two elements in wordFrequency you need to swap the two element with the same indexes in uniqueWords. At the end of the sort by frequency all words in uniqueWords will be grouped by frequency, but not by ASCII order.
To sort words in uniqueWords by ASCII order within each unique frequency determine the first and last element with the same frequency withing wordFrequency. Then do a bubble sort on just that range of wordFrequency and uniqueWords exchanging elements within both arrays at the same time as before. Repeat for each new value of frequency within wordFrequency. When all sorted, print to screen by index each element in uniqueWord and wordFrequency.
All the hassle regarding keeping the uniqueWords and wordFrequency arrays in parallel order goes away if you could store both the frequency and word within a given object like an instance of a class/struct, but since you can't do that, using parallel arrays can get the job done.