Introduction

Merge Sort
(Pseudocode)
Design and Analysis
of Algorithms I
Tim Roughgarden
Merge Sort: Pseudocode

Tim Roughgarden
Pseudocode for Merge:

Tim Roughgarden
Pseudocode for Merge:
C = output [length = n] for k = 1 to n
A = 1st sorted array [n/2] if A(i) < B(j)
B = 2nd sorted array [n/2] C(k) = A(i)
i=1 i++
j=1 else [B(j) < A(i)]
C(k) = B(j)
j++
end
(ignores end cases)
Tim Roughgarden
Merge Sort Running Time?

Tim Roughgarden
Pseudocode for Merge:
C = output [length = n] for k = 1 to n
A = 1st sorted array [n/2] if A(i) < B(j)
B = 2nd sorted array [n/2] C(k) = A(i)
i=1 i++
j=1 else [B(j) < A(i)]
C(k) = B(j)
j++
end
(ignores end cases)
Tim Roughgarden
Running Time of Merge

Tim Roughgarden
Running Time of Merge Sort

Tim Roughgarden