Module 1 quiz: analysis and arrays

What is the worst-case time complexity of searching for a value in an unsorted array of n elements?

• O(1)
• O(log n)
• O(n)(selected)
• O(n log n)

Binary search can be applied directly to an unsorted array.

• True
• False(selected)

Which of the following operations are constant time on a doubly linked list, given a reference to the node involved?

• Insert a new node after the given node(selected)
• Delete the given node
• Access the element at position n/2
• Read the value stored in the given node(selected)