Unformatted text preview: pivot). And that unbalanced partitioning will continue during the whole iterations until the array elements finishes. Therefore it will need running time of T(n) = T(n1) + θn , which as solved in the previous exercise is θ (n 2 )....
View
Full Document
 Spring '09
 Dr.Ayman
 Algorithms, Sort, Big O notation, Analysis of algorithms, Computational complexity theory

Click to edit the document details