Difference between revisions of "4.5"
Jump to navigation
Jump to search
(Created page with "O(nlogn) solution: : sort the array first, : scan the array, keep updating a max_so_far counter. O(n) solution: : put each value into hash map with the value as key and fre...") |
(No difference)
|
Latest revision as of 18:21, 20 September 2020
O(nlogn) solution:
- sort the array first,
- scan the array, keep updating a max_so_far counter.
O(n) solution:
- put each value into hash map with the value as key and frequency as value
- scan the hash map to find the max
Back to Chapter 4
