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

Appearance settings

Commit 799b157

Browse filesBrowse files
authored
Merge pull request cp-algorithms#1301 from Ahmed-Elshitehi/patch-1
added new easy problem from codeforces (1978B)
2 parents ea9af5e + 6f07da3 commit 799b157
Copy full SHA for 799b157

File tree

Expand file treeCollapse file tree

1 file changed

+1
-0
lines changed
Filter options
Expand file treeCollapse file tree

1 file changed

+1
-0
lines changed

‎src/num_methods/ternary_search.md

Copy file name to clipboardExpand all lines: src/num_methods/ternary_search.md
+1Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -81,6 +81,7 @@ Here `eps` is in fact the absolute error (not taking into account errors due to
8181
Instead of the criterion `r - l > eps`, we can select a constant number of iterations as a stopping criterion. The number of iterations should be chosen to ensure the required accuracy. Typically, in most programming challenges the error limit is ${10}^{-6}$ and thus 200 - 300 iterations are sufficient. Also, the number of iterations doesn't depend on the values of $l$ and $r$, so the number of iterations corresponds to the required relative error.
8282

8383
## Practice Problems
84+
- [Codeforces - New Bakery](https://codeforces.com/problemset/problem/1978/B)
8485
- [Codechef - Race time](https://www.codechef.com/problems/AMCS03)
8586
- [Hackerearth - Rescuer](https://www.hackerearth.com/problem/algorithm/rescuer-2d2495cb/)
8687
- [Spoj - Building Construction](http://www.spoj.com/problems/KOPC12A/)

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.