info@avatto.com
+91-9920808017
0. Which of the following shows the correct relationship among some of the more common computing times for algorithms?
O(log n) < O(n) < O( n* log n) < O(2n) < O(n2)
O(n) < O(log n) < O( n* log n) < O(2n) < O(n2)
O(n) < O(log n) < O( n* log n) < O(n2) < O(2n)
O(log n) < O(n) < O( n* log n) < O(n2) < O(2n)
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.