Algorithms

Time	Temp[degC]
0.0	35.00
0.0	33.40
0.1	31.94
0.2	30.61
0.3	29.40
0.4	28.29
0.5	27.29
0.6	26.38
0.7	25.55
0.8	24.80
0.9	24.13
1.0	23.52

And when its getting warmer:

2.7	19.44
2.8	19.42
2.9	19.42
3.0	19.42
3.1	19.44
3.2	19.47
3.3	19.51
3.4	19.56
3.5	19.61
3.6	19.68
3.7	19.75 

0 0
24 11
7 34
78 196
218 308
289 461
344 412
380 451
516 451
543 554
605 591
600 600

Create a recurrence function to represent the following algorithm's time complexity and use the master method to analyse the following algorithm:

/* The function f(x) is unimodal over the range [min, max] and can be evaluated in Θ(1) time
 * ε > 0 is the precision of the algorithm, typically ε is very small
 * max > min
 * n = (max - min)/ε, n > 0, where n is the problem size */
Algorithm(max, min)
{
     if ((max - min) < ε)
     {
           return (max - min)/2   // return the answer
     }


     leftThird = (2 * min + max) / 3      // represents the point which is 1/3 of the way from min to max
     rightThird = (min + 2 * max) / 3   // represents the point which is 2/3 of the way from min to max

     if (f(leftThird) < f(rightThird))
     {
           return Algorithm(leftThird, max)   // look for the answer in the interval between leftThird and max
     }
     else
     {
           return Algorithm(min, rightThird)  // look for the answer in the interval between min and rightThird
     }
}