Andrew Healey • 4/30/2019

Fun With Linear Time: My Favorite Algorithm

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