On Mon, May 31, 2010 at 10:01 PM, souravsain souravs...@gmail.com wrote:
Hi All
This is my first post to this community and so am exited. The problem
is to find the no. that has maximum frequency in an array (size n) of
integers.
The approach to use a hash table, itereate through array
This question has already been discussed here.There are 4-5 methods to do
this ,best is 'Moore voting algorithm' .
refer:
http://geeksforgeeks.org/?p=503
On Mon, May 31, 2010 at 10:01 PM, souravsain souravs...@gmail.com wrote:
Hi All
This is my first post to this community and so am
see this .vote majority algorithm..
http://userweb.cs.utexas.edu/~moore/best-ideas/mjrty/index.html
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this
This is a different problem, where the requested number with maximum
frequency is not necessary majority.
On 2010-6-1 13:19, harit agarwal wrote:
see this .vote majority algorithm..
http://userweb.cs.utexas.edu/~moore/best-ideas/mjrty/index.html
Hi All
This is my first post to this community and so am exited. The problem
is to find the no. that has maximum frequency in an array (size n) of
integers.
The approach to use a hash table, itereate through array (O(n)) and
keep inserting into hash table (O(1)) and then scan the hash table
