Find majority element in an array in linear time i.e O(n)
Say we have list of values and we want to find out if there is any majority element i.e is there any element that apperas more than half of the times.
-
Notifications
You must be signed in to change notification settings - Fork 0
chintan-shah-25/Boyer-Moore-Majority-Voting-algo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Find majority element in an array in linear time
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published