title: sorting a partially sorted array with insertion sort
body: <p>I hava an array with the first until the N element are sorted and N+1 until elemnt N+M unsorted (the array consist of N+M elements). what is the complexity of sorting this array using insertion sort? I think it's (N+M)^2, is it so?</p>