Which of the Following Algorithms Has a Worst-Case Complexity of O(n²)

question 31

Multiple Choice

Which of the following algorithms has a worst-case complexity of O(n²) ?

• A) insertion sort
• B) selection sort
• C) bubble sort
• D) all of the above
• E) neither a, b, nor c

---

Definitions:

Early Speech

The initial stages of speech development in children, typically observed as babbling, word formation, and simple sentence construction.

Understanding Grammar

The ability to comprehend and apply rules and structures that govern the syntax and word use in a language.

Motherese

The simplified and exaggerated form of speech, often with higher pitch and slower rate, that adults use when talking to infants and young children.

Overregularizing

The linguistic process often seen in children's language development where they apply regular grammatical rules to words that require irregular forms.