Is it possible to get number with highest frequent appearence in array in time c

  1. Vishwap profile image53
    Vishwapposted 5 years ago

    Is it possible to get number with highest frequent appearence in array in time complexity O(n)

    also at the cost of memory

  2. profile image0
    calculus-geometryposted 5 years ago

    You might have better luck asking on stackoverflow http://stackoverflow.com/

 
working