O(N)(linear time) is better than O(1) constant time.
| A. | True |
| B. | False |
| C. | |
| D. | |
Answer : B Explanation : gayatri said: (2:03pm on Thursday 18th April 2013)
why???Please explain...
simar said: (8:27am on Thursday 19th November 2015)
becoz in o(n)tym we find element in the middle or the last of the series bt in o(1) we find the element at first position so its better.
md sarwer said: (9:59pm on Sunday 4th September 2016)
"order of" or O is defined the behaviour of function.O(n) is more complex bcoz of it depends upon the no. of inputs whereas O(1) solves the problem only in fist attempt.....no matter what is d no of inputs r....i think u got it
yogeshwar-9872480190 said: (6:03pm on Monday 16th January 2017)
Big Oh notation means upper bound value solinear upper bound value is worse than constant upper bound value
monika said: (5:09pm on Sunday 23rd July 2017)
o(1) simply means we find the data at the first position only whereas o(n) implies we can find data anywhere between 1st and nth position. so o(n) is time consuming.
ishita saraf said: (1:59am on Wednesday 30th May 2018)
z in o(n) paytm we find element in the mobile or the last of the series price in o(1) we find the position so its better is bar time and bar is bar.
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
