The Insertion, Bubble, and Selection Sort Algorithms Are All Examples

question 48

Multiple Choice

The insertion, bubble, and selection sort algorithms are all examples of algorithms that have what big-O notation run times?

• A) O(n log n)
• B) O(n^n)
• C) O(n**2)
• D) O(n**3)

---

Definitions:

Skinner

B.F. Skinner was a psychologist and behaviorist who developed theories of operant conditioning and introduced the concept of reinforcement.

Skinner Box

An experimental device used in behavior analysis to study animal behavior, particularly the effects of reinforcements on behavior.

Cognitive Learning

The acquisition of knowledge and understanding through thought, experience, and the senses.

Social Learning

Social learning is a theory that suggests people can learn new behaviors and information by observing others.