write aprogram by matlab to show/compare the interval of uncertanity of the brute force , bisctiin and fibonacci mehods

In summary, three of the possible search techniques that can be used when optimizing a function of one variable have been presented. The search techniques vary in both their efficiency and their ease of use. The easiest to apply (program) is the brute force method. Also, the trials are independent of one another, which is not true for the bisection and Fibonacci methods. Fibonacci L F n-1 no Table 9.5. Comparison of Search Techniques Brute Force Bisection Final interval 2L L of uncertainty 2(n-3)/2 Addition of new points after yes yes completion of search Trial points determined in yes no advance Number of trials can vary. Location Most flexible method; Comments of nth trial easiest to program depends on results no Most efficient, least flexible. Location of nth trial depends on results