Can we just find down the n/2-th greatest element in an array with O(n) time complexity by using quick select technique.
We could, indeed. It's significantly more code, but it would lower the time complexity.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Can we just find down the n/2-th greatest element in an array with O(n) time complexity by using quick select technique.
We could, indeed. It's significantly more code, but it would lower the time complexity.