The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Jul 2017 |
| Last Sign in: | 305 Weeks Ago |
| Questions Answered: | 15833 |
| Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
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.     [ 99, 101, 8, -22, 3, 55, 42, -1, 0, 52, 33, -4, 66, 1, 52]
 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.
[ -22, -4, -1, 0, 1, 3, 8, 22, 42, 52, 52, 55, 66, 99, 101]
Â
Note
I need answer not a rule ,
The first is Sequential search=O(log N)
And the second is Binary search=O(N
 I know this rule already, it is in the book , I need the step how to do it and the result of collocation .
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly