Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

215 kth largest element in an array #14

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.

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

Merged
zwfang merged 1 commit into master from kth-largest-element-in-an-array
Dec 22, 2018

Conversation

Copy link
Collaborator

@zwfang zwfang commented Dec 22, 2018

No description provided.

@zwfang zwfang added array An array is stored such that the position of each element can be computed from its index sort Sorting algorithm is an algorithm that puts elements of a list in a certain order. heap(priority queue) a heap is a specialized tree-based data structure which is essentially an almost complete tree labels Dec 22, 2018
Copy link

codecov bot commented Dec 22, 2018 •
edited
Loading

Codecov Report

Merging #14 into master will increase coverage by 0.02%.
The diff coverage is 100%.

Impacted file tree graph 

@@ Coverage Diff @@
## master #14 +/- ##
==========================================
+ Coverage 98.93% 98.95% +0.02% 
==========================================
 Files 55 56 +1 
 Lines 934 950 +16 
==========================================
+ Hits 924 940 +16 
 Misses 6 6 
 Partials 4 4
Impacted Files Coverage Δ
...c/0215_kth_largest_element_in_an_array/kthleiaa.go 100% <100%> (ø)

@zwfang zwfang self-assigned this Dec 22, 2018
@zwfang zwfang merged commit 5a76144 into master Dec 22, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Labels
array An array is stored such that the position of each element can be computed from its index heap(priority queue) a heap is a specialized tree-based data structure which is essentially an almost complete tree sort Sorting algorithm is an algorithm that puts elements of a list in a certain order.
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant

AltStyle によって変換されたページ (->オリジナル) /