Sort And Searching Interview Question:

What is Mergesort and Hashtable?

Submitted by: Administrator

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
Submitted by: Administrator