GATE Computer Science (CS) 2015 Shift 1 Solved Paper

Question : 14 of 65

Marks: +1, -0

Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting (𝑛 ≥ 2) numbers? In the recurrence equations given in the options below, 𝑐 is a constant.