stevea@vast.eecs.unsw.oz.au (Steve Avery) (03/27/91)
In a project I am currently undertaking, it is necessary to determine
the mode (ie. most frequent element) of a set of numbers (with fixed
number of elements). There is no restriction on the type of algorithm
to be applied, other than it have time complexity O(log n), where n is
the number of elements. The set is originally unsorted, but of course
I can easily perform a sort in O(log n).
Is anyone aware of an algorithm I might employ to implement this function?
Is there any way to determine the frequency of the lements of a set in
O(log n) time?
Any references or ideas would be greatly appreciated.
Thanks in advance.
-steve
-------------------------------------------------------------------------------
Steve Avery | VLSI & Systems Technology Laboratory,
| School of Computer Science & Engineering,
stevea@vast.eecs.unsw.oz.au | University of New South Wales,
stevea@spectrum.cs.unsw.oz.au | P.O. Box 1, Kensington, NSW, Australia, 2033
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell