prove that in algorithm insertionsort, for successively considered element a[i] there is equal probablity that element will be inserted in one of i positions:a[1] <= a[2] <= ... <= a[i-1]To my eye it is obvious and I can't prove it. What is your opinion ?
position to insert element in inserionsort (equality of probablity)
sorting