Question: Select all the correct answers: (more than one answer can be correct): Which of the algorithms running times comparisons are correct: ( 2 points) O(log(n))
Select all the correct answers: (more than one answer can be correct):
Which of the algorithms running times comparisons are correct: ( 2 points) O(log(n)) < O(n) < O(n!) O(log(n)) < O( n2 ) < O( n.log(n)) O(n2.log(n)) < O(exp(n)) O(1) < O(log(n)) < O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
