Skip to content

FIX: adding upcoming elements to the heap, after first k ones. #252

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

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

FIX: adding upcoming elements to the heap, after first k ones. #252

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion epi_judge_python_solutions/sort_almost_sorted_array.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ def sort_approximately_sorted_array(sequence: Iterator[int],

result = []
# For every new element, add it to min_heap and extract the smallest.
for x in sequence:
for x in sequence[k:]:
smallest = heapq.heappushpop(min_heap, x)
result.append(smallest)

Expand Down