I am trying to find an algorithm that finds kth smallest element from unsorted array of size n at O(n) by using a function that returns the median of array of size n at O(n). I think I have to find a recursive function that has time complexity like cn+cn/2+cn/2^2+....+cn/2^j=O(n).
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
1.2k Views Asked by kiarashmo At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in MEDIAN
- Getting wrong answer in Binary Search solution
- Find median in constant time O(1)
- Plotting medians between nested boxplots with ggplot2
- Finding the median of an unsorted array without sorting
- median of 2 sorted array - by binary method
- How to use subquery in OFFSET in MySQL?
- How can I get an algebraic equation of a median curved line from ggplot in R?
- How to extract the p value about if there is a statistically-significant diiference between the medians using the survfit function?
- Finding the Median for every 3 values in a column
- binary search left and right index to find median of two sorted arrays
- Finding the median of every 3 rows in a data set
- How to look for the 10^5th largest element in an array of 10^10 elements?
- Finding the median of a time type column in MySQL
- Speedup median in dax(ssas)
- How to plot results from median_test using ggplot annotate in R?
Related Questions in MEDIAN-OF-MEDIANS
- Median Queries:- a subarray of A of length , you have to sort the elements of the subarray in a non-decreasing order
- Shouldn't the median of medians algorithm's running time be O(nlogn)?
- Median of medians algorithm: why divide the array into blocks of size 5 what if we divide into group of 4 is this effect time complexity
- find multiple elements of different ranks from unsorted array
- 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
- What exactly is special on this case that my median algorithm doesn't work anymore?
- Generalizing the median of medians algorithm
- How to implement the medians of medians algorithm in Java
- Finding median of a list using quick select and median-of-medians
- Quick select with random pick index or with median of medians?
- Time complexity for median of medians
- Median of medians in Python doesn't run in O(n)
- Numpy median-of-means computation across unequal-sized array
- Why is my "median of medians"-algortihm always wrong by just a few positions?
- Dividing the list in 8 instead of 5 in the median of median algorithms
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 # Hahtags
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?
You can use quickselect, using the provided O(n) median-finding algorithm.
Find the median in O(n) time, separate the array into three parts (smaller, equal and greater than the median), then recurse into the relevant part.
The complexity analysis is easy (compared to the standard randomized Quickselect algorithm). Finding the median and pivoting the array are both O(n), and then the size of array one recurses into has at most n/2 elements (by the definition of median). So the recurrence relation is T(n) = n + T(n/2) for which the solution is T(n) = O(n).