Discussion
O(N)(linear time) is better than O(1) constant time.
Answer: B
Correct answer: False
\(O(1)\) means the work does not grow with the input at all, while \(O(N)\) grows in proportion to it. For any large enough \(N\) the constant-time operation wins, so the statement is false. This is why a hash lookup is preferred to a linear scan.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development