which sorting algorithm with the highest worst time

insertion sort

Bitonic sort$=$O$($n$*$log$^2($n$)).$

shellsort$=$theta$($n$^1\mathrm{.}5)$

mysterious sorting$=4$T$($n$/3)+$n$^2/$lg$($n$)$