title: Why Insertion sort faster than Merge sort?
body: <p>I created on jsperf.com test for 3 sorting methods: Bubble, Insertion and Merge. <a href="http://jsperf.com/bubblesort-vs-insertsort" rel="nofollow">Link</a></p>
  
  <p>Before test I create unsorted array with random number from 0 to 1Mln.
  Each time test shows that Insertion sort faster than Merge one.
  What's reason for such result, if Merge sort time O(n log(n)) while Insertion and Bubble sorts have O(n^2) 
  <a href="http://i.stack.imgur.com/8QPY9.png" rel="nofollow">test result here</a> </p>