TK Memo
Sign in

Merge sort

Computer Science · Algorithms ⁨14⁩ views

Split the row, sort each half, then merge front versus front. Equal is not smaller, so the left 2 is taken first and start order stays. Time is O of n log n.

divide and conquermerge sortsortingstable