Suppose We Maintain a Linked List of Length N in Random

question 92

Multiple Choice

Suppose we maintain a linked list of length n in random element order. What would be the big-Oh notation for an algorithm that prints each list element and the number of times it occurs in the list (without sorting the list) ?

• A) O(1)
• B) O(n)
• C) O(n log₂ n)
• D) O(n²)

---

Definitions:

Phrases

A small group of words standing together as a conceptual unit, typically forming a component of a clause.

Inefficient

Not achieving maximum productivity; wasting or failing to make the best use of time or resources.

White Space

The unmarked or empty areas in a document or web page layout, used to create visual breathing room and enhance readability.

Margin

The difference between the cost of a product or service and its selling price, expressed as a percentage of the selling price.