title: Modified merge Sort Algorithm
body: <p>Describe a modified merge sort algorithm, in which a given sequence is split into split into three sub-sequences of equal size approximately one-third. Analyze asymptotically the time complexity of your algorithm. How to solve this?</p>