2017百度春招：度度熊有一个N个数的数组，他想将数组从小到大 排好序，但是萌萌的度度熊只会下面这个操作：任取数组中的一个数然后将它放置在数组的最后一个位置。问最少操作多少次可以使得数组从小到大有序？(2017 Baidu Spring Recruit: degree bear has an array of N number, he would like to array from small to large row order, but Meng Meng degree of the bear will only be the following operation: any number of array and then it Placed in the last position of the array. Ask how many times the operation can make the array from small to large order?)