Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Verbal Reasoning
»
Arithmetic Reasoning
The complexity of linear search algorithm is
O(n2)
O(n log n)
O(n)
O(log n)
Correct Answer:
O(n)
Explanation:
The worst case complexity of linear search is O(n).
← Previous Question
Next Question→
More Questions from
Arithmetic Reasoning
6 choose 3 =
The price of commodity X increases by 60 rupees every year, while the price of commodity Y increases by 20 rupees every year. If in 2002, the price of commodity X was Rs. 320 and that of Y was Rs. 740, in which year commodity X will cost 60 rupees more than the commodity Y ?
At what time will B catch up with A, if A starts from a place at 11.00 A.M. and travels at a speed of 3.5 kmph, B starts at 1.00 P.M. and travels with speeds of 1 kmph for 1 hour, 2 kmph for the next 1 hour, 3 kmph for the next 1 hour and so on.
What is the time required to punch 1500 cards of 45 column each at the rate of 9,000 punches per hour ?
A kiddy bank of a child contains all Rs. 1, 50 paise and 25 paise coins. What is the total amount in the bank ? (1) Total number of coins are 20 (2) The number of 50 paise and 25 paise coins are in the ratio of 7:3.
Multiplicative inverse of 0
How many right angles does a square have?
What is the value of 28 tens?
9 tens 10 ones equals
Smallest prime number greater than 200?
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments