M
Q. What will be the time complexity of the code to reverse stack recursively?
Explanation by: Mr. Dubey
the recurrence relation for the recursive code to reverse stack will be given by-t(n)=t(n-1)+n.this is calculated to be equal to o(n2).
You must be Logged in to update hint/solution
Be the first to start discuss.
Related MCQs
Q. Array with last element 'n' will always have array size equal to _______.
Q. In stack, to display the lastly inserted element without removing it, which function is used?
Q. technology often used in "smart cards," have small radio
Q. What is the subnet id of a host with an IP address 172.16.66.0/21?
Q. a.(b.c) = (a.b).c is the representation for which property?
Q. The compiler will complain if you try to access array element 14 in a 10-element array.
Q. What is the mounting of file system?
Q. What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
Question analytics
Discusssion
Login to discuss.