<reponame>loftwah/Daily-Coding-Problem
"""This problem was asked by Dropbox.

Create an algorithm to efficiently compute the approximate median of a list of numbers.

More precisely, given an unordered list of N numbers, find an element whose rank 
is between N / 4 and 3 * N / 4, with a high level of certainty, in less than O(N) time."""
"""This problem was asked by Dropbox.

Create an algorithm to efficiently compute the approximate median of a list of numbers.

More precisely, given an unordered list of N numbers, find an element whose rank 
is between N / 4 and 3 * N / 4, with a high level of certainty, in less than O(N) time."""
This problem was asked by Dropbox.  Create an algorithm to efficiently compute the approximate median of a list of numbers.  More precisely, given an unordered list of N numbers, find an element whose rank  is between N / 4 and 3 * N / 4, with a high level of certainty, in less than O(N) time.