Im trying to work something out but cant see why it is the way it is!
I have worked out that a MergeSort has a time complexity of O(n log n)
I have also created a new merge algorithm for 3 splts... which again has given me a time complexity of O(n log n). Im guessing that k splits would still result in O(n log n).
Is there any case when a large split would be better suited?
I have worked out that a MergeSort has a time complexity of O(n log n)
I have also created a new merge algorithm for 3 splts... which again has given me a time complexity of O(n log n). Im guessing that k splits would still result in O(n log n).
Is there any case when a large split would be better suited?