4 2 3 1 4 2 partition 31 Input: 5 914 873 0 2 6 Thread 139754931013376 before: 7 3 0 2 6 Thread 139754922620672 before: 7 3 0 Thread 139754914227968 before: 2 6 Thread 139754939406080 before: 5 9 1 4 8 Thread 139754905835264 before: 7 3 Thread 139754889049856 before: 5 9 1 Thread 139754670647040 before:7 Thread 139754897442560 before: 2 sort sort 2 4 merge 1 3 1 2 3 4 First, an unsorted list of data is divided into as many small partitions as possible. Then these partitions Thread 139754897442560 after : 2 get sorted internally, and merged back together with other partitions to produce the sorted list. In Thread 139754662254336 before: 6 Introduction to Algorithms1, pseudo-code of the algorithm is given as follows: Thread 139754662254336 after6 Thread 139754914227968 after 2 6 Thread 139754637076224 before:3 Thread 139754637076224 after 3 Thread 139754679039744 before: 0 Thread 139754679039744 after0 Thread 139754653861632 before: 4 8 Thread 139754662254336 before: 4 Thread 139754662254336 after4 Thread 139754645468928 before: 5 9 Thread 139754897442560 before: 8 Thread 139754628683520 before: 1 Thread 139754628683520 after 1 Thread 139754670647040 after7 Thread 139754897442560 after8 Thread 139754905835264 after3 7 Thread 139754653861632 after 4 8 Thread 139754922620672 after 0 3 7 Thread 139754931013376 after 0 2 3 6 7 Thread 139754662254336 before: 5 Thread 139754662254336 after 5 Thread 139754410604288 before: 9 Thread 139754410604288 after9 Thread 139754645468928 after5 9 Thread 139754889049856 after1 5 9 MERGE-SORT(A, p,r) 1 ifp