Merge Sort

how to implement merge sort with divide and conquer, why it guarantees O(n log n), and when to choose stable sorting over in-place alternatives