2010 A Invitational:
Given an array of N distinct elements in random order, what is the Big O of the traditional implementation of the quicksort
algorithm?
A. O(NlogN) B. O(N2) C. O(N2logN) D. O(N3/2) E. O(N3)
Return to UIL Computer Science
Users browsing this forum: No registered users and 2 guests