CPS130, Lecture 1: Introduction to Algorithms

HW1 (homework): Use merge to write pseudo code for insertion-sort and merge-sort. Most of you will write insertion-sort with a loop, but clearly merge-sort seems different and it is. However, you can also write merge-sort with a loop, certainly for n=2k. Try it for n=8; and get extra credit for writing in a … ................
................