SS and IS :: $ 54321 $
MS ::: it takes same time for best and worst (whatever input it is) $ O(n logn) $
QS :: Inputs are in ascending order or descending order or All elements are same.
BS :: It performs at $O(n^2)$ when all elements at allocated to the same bucket.
CS :: When range is too high. EX - $[1,1000,2,6]$
BS :: Sorted in reverse order. $[5,4,3,2,1]$