Sorting algorithms can also be characterized as

Answer:  A

Sorting algorithms can also be characterized as simple or sophisticated. 

Simple algorithms require the O (n^2) comparisons to sort n items.

While sophisticated algorithms require the O (log₂n) comparisons to sort n items.