Chapter 4, Problem 56C

Explanation of Solution

Efficient algorithm to determine the integer value:

Consider that the array of size “n” contains the numbers range from 0 to “4n” and it is given that the maximum number repeated in this array.

The best approach to determine the integer value “k” that occurs most repeatedly in array “A” as follows:

• Initially create the count array of size “k”
• Initialize the count element as 0
• Iterate all the elements of input array
• Execute for loop for every element of arr[i], increment the count[arr[i]].
• Finally, iterate the count[] array and return the index with maximum value.

Running time of algorithm:

In the above algorithm, the approach follows two loops...