Which of the following sorting algorithms is comparison-based?

Which sorting algorithms can be used to efficiently sort a random linked list?

What is another name for the quick hull problem?

How do you free the memory that is allocated at runtime?

What type of tree traversal is represented by the given code?

Binary search tree has a best case run-time complexity of O(log n). What could be the worst case complexity?

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is 

Which condition must be true for the exponential search algorithm to work correctly?

A queue is used for implementing which type of branch and bound strategy?

When an array is sorted and has a uniform distribution of values, which search algorithm performs better?