The insertion sort algorithm is an example of an algorithm in which the worst case of running time is

Question $9$ options:

$\backslash$Theta $($lg n$)$

$\backslash$Theta $($n$)$

$\backslash$Theta $($n lg n$)$

$\backslash$Theta $($ n$2)$