Hello I am trying to understand how the median of medians algorithm works. In all examples I've seen so far there already are the groups of the numbers divided , before the execution of the algorithm begins. So I cannot understand how these groups are made. To be more specific at the examples studied so far, is stated that there are 9 groups of 5 numbers each, for example aka 45 numbers, or 4 groups of 10 numbers aka 40 numbers at all. So what if we have n numbers..? Is there any good technique that should I follow to find the number of elements its group should have ?
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in MEDIAN-OF-MEDIANS
- What is the worst case time complexity of median of medians quicksort?
- Algorithmic Reduction (Median of medians, quicksort)
- choosing pivot for the quickselect using median implemented in java?
- Median of Medians space complexity
- Something I dont understand about median of medians algorithm
- Finding median of a list using quick select and median-of-medians
- How to implement the medians of medians algorithm in Java
- Find a median of N^2 numbers having memory for N of them
- Median of Medians Big Example
- Median Queries:- a subarray of A of length , you have to sort the elements of the subarray in a non-decreasing order
- correctness of fast small order statistic algorithm for odd-length array
- What exactly is special on this case that my median algorithm doesn't work anymore?
- How to find the kth smallest element at O(n) if we know there is O(n) function that returns the median of an array
- find multiple elements of different ranks from unsorted array
- Shouldn't the median of medians algorithm's running time be O(nlogn)?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
MoM is a recursive algorithm. It exists as a sound way to select a "pivot" for an algorithm like quicksort or quickselect. Thus, it needs to operate within certain time bounds.
It might be easier to understand if explained as a base case and a recursive case.
The base case is clear enough. If you have less than five elements in a list, then you find the median the naive way.
But, if your list has at least five elements, you can apply the recursive case. You're going to take successive groups of five elements from your big list, find their median, and add it to a smaller list. (If you have some left over, you can ignore them.)
If this new, smaller list is small enough, you can apply the base case, as described above. Otherwise, you'll go through the "small" list to create another, still smaller list. Lather, rinse, and repeat until you get down to less than five elements remaining. And that's your estimate of the overall median. So it works with any size of list.
So how big should "five" be? Well, it turns out that 5 is optimal. Someone showed the complexity analysis over at the Wikipedia page for this topic. Essentially, larger values of "five" get you a better approximation of the median at the cost of more work to find the median of "five". Unfortunately 3 does not decrease the search space enough per iteration to be a worthwhile choice of "five". And it generally needs to be odd, unless you want to spend cycles splitting the difference between elements.