Sort And Searching Question:
Download Questions PDF

What is Mergesort and Hashtable?


In short:
Mergesort is a sorting algorithm that follows the paradigm of: divide and conquer:

1) recursivly split the array in 2
2) until the array length is 1 ( or the pointers start and end are equal)
3) merge the sorted array an return the array sorted

Download Sort And Searching Interview Questions And Answers PDF

Previous QuestionNext Question
Do you know what is linear search?What is Binary Search Tree and explain its time complexity?