Question: What is the least time in which we can raise a number x to power y?
Options
A : O(x)
B : O(y)
C : O(log x)
D : O(log y)
Click to view Correct Answer
Data Structure Power Number Recursion Logn Time more questions
Floyd Warshall Algorithm used to solve the shortest path problem....
Time complexity to check if an edge exists between two....
What will be the time complexity of the iterative depth....
What is the space complexity of standard DFS(V: no. of....
The time complexity to find a Eulerian path in a....
Reduce the following Big-O notation. O[ en + an10] =
Reduce the following Big-O notation. O[ ax7 + 3 x3....
Which of the Ars operon regulation site is actually preventing....
Which of the following gases do plants require for respiration?
The half leaf experiment showed that _____ is important for....
Data Structure Adjacency List more Online Exam Quiz
Data Structure Number Jumps Reach End Array Operation
Data Structure Preorder Traversal