Finding median without sorting the array
Finding median without sorting the array

The idea is taken from quick sort partitioning. After partitioning
the pivot settles at the correct position. Now if that position is
not the median position then we have to keep partition the bigger
side of the pivot until pivot is swapped at the median position.

rezaur86/Coding-competitions,rezaur86/Coding-competitions