write recurrence equation for worst case time complexity of all type of sort algorithm. with proof.

for examaple --:

quick sort recrrance equations for worst time complexity is T(n) = T(n 1) + T(1) + cn

then what will be recurrence equation for worst case time complexity of all type of sort algorithm , give with proof (bubble sort , insertion sort , merge sort ,selection sort , heapsort)