The Insertion Sort Algorithm Is an Example of an Algorithm $\Theta \left( \log _ { 2 } n \right)$

Multiple Choice

The insertion sort algorithm is an example of an algorithm in which of the following classes?

A) $\Theta \left( \log _ { 2 } n \right)$
B) $\Theta ( n )$
C) $\Theta \left( n \log _ { 2 } n \right)$
D) $\Theta \left( n ^ { 2 } \right)$