[JAVA] Shannon Entropy

Problem 3. (Shannon Entropy) A nice way of characterizing duplicates in an input is using Shannon entropy. Given an input of size N with k distinct values, for each i from 1 to k define fi to be frequency of occurrence of the ith value and p to be fi/N, the probability that the ith key value is found when a random entry of the array is sampled. The Shannon entropy of the input is calculated as k: H=- Note that H E [0,1], with H 0 when the N items that are all the same, and with H 1 when they are all different. Implement the static method entropy in ShannonEntropy.java that takes an array al of Comparable objects and returns its Shannon entropy. Your implementation must be linearithmic $ java ShannonEntropy 1000 5 H = 0.23 $ java ShannonEntropy 1000 4:1