The sort time is more-or-less O(logn),
No, you moron. Sorting is, at best, O(N log N).
In reply to Re^2: count the maximum no.of occurence
by BrowserUk
in thread count the maximum no.of occurence
by sarvan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |