Abstract
We show that the problem of finding the element with the highest frequency in a set, the mode of the set, is bounded by the problem of sorting multisets. As a consequence, we obtained an improvement of the upper bound for finding the mode. This result was obtained by presenting an algorithm that requires linear time when the set is initially sorted. The same algorithm was parallelized to produce the first optimal parallel algorithm for finding the mode.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
