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

Update translation of korean #1022

Merged
merged 4 commits into from
Nov 19, 2021
Merged

Update translation of korean #1022

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
5d79de5
Fix wrong typo
joonas-yoon May 26, 2019
5e362d6
Merge branch 'master' of https://github.com/joonas-yoon/coding-interv…
joonas-yoon May 26, 2019
deade3a
Merge branch 'jwasham:main' into master
joonas-yoon Nov 18, 2021
27993e0
Update headings and sync to main
joonas-yoon Nov 18, 2021
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 README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -833,7 +833,7 @@ if you can identify the runtime complexity of different algorithms. It's a super
- [ ] is_empty() - returns true if heap contains no elements
- [ ] extract_max - returns the max item, removing it
- [ ] sift_down - needed for extract_max
- [ ] remove(i) - removes item at index x
- [ ] remove(x) - removes item at index x
joonas-yoon marked this conversation as resolved.
Show resolved Hide resolved
- [ ] heapify - create a heap from an array of elements, needed for heap_sort
- [ ] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a max heap or min heap

Expand Down
Loading