T(n) = T(k) + T(n ? k) + \alpha n

where T(n) refers to the time taken by the algorithm to sort n elements.

Worst Case Analysis:
https://media.cheggcdn.com/media%2F3d0%2F3d0ac955-3074-4261-97d6-3a2b9594fdab%2FphpkvXpxa.png

https://media.cheggcdn.com/media%2F99c%2F99c3feaa-6a3a-45ae-8a88-54b206bbb4f1%2Fphpcwfo2n.png

Best Case Analysis:
https://media.cheggcdn.com/media%2Fdea%2Fdeae8ace-3fca-4715-bf56-9bceeb0ff710%2FphptI94Wm.png

https://media.cheggcdn.com/media%2F040%2F040329a4-0200-4008-94c2-0c56cd10ac94%2FphpqWkWvj.png