AdvancedNumeric answer
A root-finding guarantee · Part 3 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.
Starting again from [1,2], how many bisection iterations guarantee a final bracket width at most 1/128?
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.
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
- How many comparisons does a binary search need, in the worst case, over a…Foundation
- A balanced binary search tree holds one million keys.Foundation
- What is the maximum number of edges in a directed acyclic graph on ten vertices?Foundation
- How many set bits does the integer 90 have?Foundation
- How many non-empty contiguous subarrays does an array of length ten have?Foundation