Insertion Sort, Merge Sort

Insertion Sort, Merge Sort

Merge Sort assumes that two sorted arrays as input:

  [1,2,3,8,9,10] could to be splited as  [1,3,8],  [2,9,10]; first 1 and 2  could do a comparision, the 1 will be put down; then 3 will be compared with 2,

  then 2 will be write down, and so on, so forth; [1,2,3,8,9,10]

Inserting sort:

In place merge sort:

test it in the python meger sort and insert sort;

 

Models of Computation, Document Distance

--Models of computation specifies what operations an algorithm is allowed

--cost(time) of each operations