Through this post, I’m sharing Python code implementing the median of medians algorithm, an algorithm that resembles quickselect, differing only in the way in which the pivot is chosen, i.e, deterministically, instead of at random. Its best case complexity is O[n] and worst case complexity O[nlog2n] I don’t have a formal education in CS, and came across this algorithm while going through Tim Roughgarden’s Coursera
MOOC on the design and analysis of algorithms. Check out my implementation in Python.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
| def merge_tuple[a,b]: | |
| """ Function to merge two arrays of tuples """ | |
| c = [] | |
| while len[a] != 0 and len[b] != 0: | |
if a[0][0] Chủ Đề |