Email:
Password:
Remember Me
Forgot your password?
Log in
New to Satt Academy?
Create an account
or
Log in with Google Account
Home
Ask Question?
Business Account
Exam
Exam List
Exam Result
Category
1-12 Class
Board Exam
Admission
Job Solution
Skill Development
Book Collection
Video Content
Blog Content
Question
Ask Question?
Current Affairs
All MCQ Question
All Written Question
Upload Question
General
Study Plan
Hand Note
Notice | News
Other
FAQ
Point
Package
Feedback
Home
Academy
Admission
Job Assistant
Current Affairs
Skill
Forum
Blog
Package
Course
Sign In
Unauthenticate
Guest
example@gmail.com
Login
Description
Home
Edit Description
Back
Edit Description
Fill up the form and submit
Question
The complexity of Binary search algorithm is ___
O (n)
O (log n)
O (
n
2
)
O ( n log n )
ANSWER : 2
Descrption
<p>Binary search runs in at worst logarithmic time, making O ( log n) comparison , where n is the number of elements in the array, the O is Big O notation, and log is the logarithm . </p>
Please, login first.
click here to login
Cancel
Login
©2024 SATT ACADEMY. All rights reserved.
Promotion
