上海交通大学：《C程序与算法设计》课程教学资源（课件讲稿）Lecture 02 Divide and Conquer

上游充通大粤 Merging two sorted arrays SHANGHAI JIAO TONG UNIVERSITY Subarray 1Subarray 2 2013 7个2 3/12/2022 11

3/12/2022 11 20 13 7 2 Merging two sorted arrays 12 11 9 1 Subarray 1Subarray 2

上游充通大粤 Merging two sorted arrays SHANGHAI JIAO TONG UNIVERSITY 20 12 13 11 7 9 2 1 3/12/2022 12

3/12/2022 12 20 13 7 2 Merging two sorted arrays 12 11 9 1

上游充通大粤 Merging two sorted arrays SHANGHAI JIAO TONG UNIVERSITY 20 12 1311 79 9 2 3/12/2022 13

3/12/2022 13 Merging two sorted arrays 20 13 7 2 12 11 9 1

上游充通大粤 Merging two sorted arrays SHANGHAI JIAO TONG UNIVERSITY 20 12 1311 7 3/12/2022 14

3/12/2022 14 Merging two sorted arrays 20 13 7 2 12 11 9 1 1

上游充通大学 Merging two sorted arrays SHANGHAI JIAO TONG UNIVERSITY 20 12 20 12 1311 13 11 7 1 9 2 3/1212022 15

3/12/2022 15 Merging two sorted arrays 20 13 7 2 12 11 9 1 1 20 13 7 2 12 11 9