Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object in to a binary search tree of n nodes?
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
The worst case running time to search for an element in a balanced binary search tree with n2n elements is
GATE CSE Subjects
Theory of Computation
Database Management System