Which of the Following Algorithms Has a Worst Case Complexity

question 21

Multiple Choice

Which of the following algorithms has a worst case complexity of O(n log₂n) ?

• A) insertion sort
• B) selection sort
• C) bubble sort
• D) merge sort
• E) none of the above

---

Definitions:

Unconditioned Stimulus

in behavioral psychology, a stimulus that naturally and automatically triggers a response without the need for prior learning.

Conditioned Stimulus

A previously neutral stimulus that, after becoming associated with an unconditioned stimulus, eventually triggers a conditioned response.

Conditioned Response

A learned response to a previously neutral stimulus that has been repeatedly associated with an unconditioned stimulus.

Unconditioned Response

An automatic and innate reaction to a stimulus, not learned through prior experience.