merge sort

Posted by jacklinstuff on March 10th, 2016

The merge Sort function demonstrated in Active Code 1 starts by inquiring the foundation case question. If on the flip side, the span is greater than one, afterward we make use of the Python cut operation to take out the right and left halves. It is necessary to notice the list might not have an even amount of things. As the spans will differ by at most one that doesn't matter. for more information visit here:- http://www.hellgeeks.com/merge-sort/