Which is faster binary or linear search?
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm
How do you implement a stack?
Can we use ordered set for performing binary search?
What is a hashers run?
What is the complexity of adding an element to the heap?
What is a matrix? Explain its uses with an example
Does linked list allow null values?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
What is a b+ tree? Explain its uses.
How would you use bsearch() function to search a name stored in array of pointers to string?
How to check array contains value or not?
Differentiate between iterable and iterator.