Andrew Healey • 4/30/2019

Fun With Linear Time: My Favorite Algorithm

Read Original

This article details the Boyer-Moore majority vote algorithm (MJRTY), an efficient approach to find the majority element in a list using O(n) time and O(1) space. It contrasts a naive dictionary-based solution with the improved algorithm, provides Python code examples, and discusses the algorithm's history and humorous original paper from 1980.

0 comments
#algorithm analysis #time complexity #Space Complexity
Fun With Linear Time: My Favorite Algorithm

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
Quoting Thariq Shihipar
Simon Willison • 2 votes
2
Using Browser Apis In React Practical Guide
Jivbcoop • 2 votes
3
Top picks — 2026 January
Paweł Grzybek • 1 votes
4
In Praise of –dry-run
Henrik Warne • 1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár • 1 votes
6
Vibe coding your first iOS app
William Denniss • 1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
8
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes