Suppose We Maintain a Linked List of Length N in Random

question 36

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²)