摘要： Problems 7-3 Stooge sort Professors Howard, Fine, and Howard have proposed the following "elegant" sorting algorithm: STOOGE-SORT(A,i,j) 1 if A[i] > A[j] 2 then exchange A[i] A[j] 3 if i+1 >= j 4 the... 阅读全文

摘要： Exercises 6.4-3 What is the running time of heapsort on an array A of length n that is already sorted in increasing order? What about decreasing order? See 6.4-5 6.4-5 Show that when all elements are... 阅读全文