*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **// last two-thirds STOOGE-SORT(A,i,j-k); // first two thirds again a). Argue that STOOGE-SORT(A,1, length[A]) correctly sorts the input array A[1. .n] , where n=length[A] . b). Give a recurrence for the worst-case running time of STOOGE-SORT . Solve the recurrence relation and find the running time using Big-O notation. c). Compare the worst case running time of STOOGE-SORT with that of insertion sort, merge sort, bubble sort, and quicksort. Doe the professors deserve tenure?...

View
Full
Document