Skip to content
This repository has been archived by the owner on Oct 22, 2024. It is now read-only.

Add complexity bound on binary search methods #239

Merged
merged 1 commit into from
May 25, 2022

Conversation

natebosch
Copy link
Contributor

Closes dart-lang/core#632

In each of the list extensions that mention "Uses binary search" add a
sentence documenting that the search takes log(n) comparisons.
Add a sentence about using binary search and the runtime to the top
level algorithm methods.

Closes #237

In each of the list extensions that mention "Uses binary search" add a
sentence documenting that the search takes `log(n)` comparisons.
Add a sentence about using binary search and the runtime to the top
level algorithm methods.
@natebosch natebosch requested a review from lrhn May 24, 2022 22:09
@natebosch natebosch merged commit 69766da into master May 25, 2022
@natebosch natebosch deleted the binary-search-runtime branch May 25, 2022 14:52
mosuem pushed a commit to dart-lang/core that referenced this pull request Oct 18, 2024
…n#239)

Closes dart-lang/collection#237

In each of the list extensions that mention "Uses binary search" add a
sentence documenting that the search takes `log(n)` comparisons.
Add a sentence about using binary search and the runtime to the top
level algorithm methods.
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Development

Successfully merging this pull request may close these issues.

lowerBound does not document expected running time
2 participants