(1) for i =1 to n-1 (2) minval A[i] (3) minindex i (4) for j=i to n (5) if (A[j]minval) (6) minval A[j] (7) minindex j (8) exchange A[i]and A[minindex] (9) bigjump =0 (10) for i 2 to n (11) if(A[i]>2*A[i-1]) (12) bigjump bigjump 1 这个算法需要执行多少次比较操作？这个算法需要执行多少次比较操作？