question two
part a) calculate the big oh performance for the sequential search on the array given below that has 15 elements? Given that sequential search of an array of 10 elements took on average 1 second. [2.5 mark points]
[ 99, 101, 8, -22, 3, 55, 42, -1, 0, 52, 33, -4, 66, 1, 52]

15 / 10 = 1.5 times
so o(n)=1.5*1=1.5 second
part b) calculate the big oh performance for the binary search on the sorted array given below that has 15 elements? Given that binary search of an array of 10 elements took on average 1 second. [2.5 mark points]
[ -22, -4, -1, 0, 1, 3, 8, 22, 42, 52, 52, 55, 66, 99, 101]

log(15 )/ log(10) = 1.176 times
so o(log n)=1.761*1=1.176 second