Data structures and algorithms
A root-finding guarantee, part 1 of 3
FoundationNumeric answer
A root-finding guarantee · Part 1 of 3
You seek the root of using bisection, starting with the bracket . One iteration evaluates the midpoint and retains the half with a sign change.
What midpoint is evaluated in the first iteration?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
More data structures and algorithms questions
- You need the 100 largest values from a stream of 10⁹ numbers you cannot store.Foundation · Free solution
- What does the recurrence T(n) = 2T(n/2)+O(n) solve to?Applied · Free solution
- What is 1oplus2oplus3oplus⋯oplus10, where oplus is bitwise XOR?Applied · Premium
- Computing x¹³ by binary exponentiation (repeated squaring), how many…Applied · Premium
- Searching a sorted array, part 2 of 3Applied · Premium
- Converting between currencies, part 2 of 3Applied · Premium