Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

More useful solution assuming ascending sort #338

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

More useful solution assuming ascending sort #338

wants to merge 1 commit into from

Commits on May 4, 2021

  1. More useful solution assuming ascending sort 

    I think this answer is more useful that just saying we don't know as we are able to prove that ascending sorted arrays are min heaps.
Stackoverflow answer to verify correct answer - https://stackoverflow.com/questions/3113165/is-a-sorted-array-a-min-heap-whats-the-minimum-value-of-a-max-heap
@gzc Please verify the chinese translation as I used google translate.
    @hazkaz
    hazkaz authored May 4, 2021
    Configuration menu
    Copy the full SHA
    4a1b603 View commit details
    Browse the repository at this point in the history