9.1.1. Arrays

Try these first

1. 1.

   What is the time complexity for accessing an element in an array?

   Hint

   Think of how elements are stored in memory.

2. 2.

   Describe how an insertion works in a linked list.

   Hint

   Think about what needs to be updated to add a new node.

3. 3.

   What access time do arrays provide?

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

   Hint

   Remember constant-time access relates to direct indexing.

4. 4.

   Accessing an element in a linked list is done in which time complexity?

   • True
   • False

   Hint

   Think about how data is organized in lists.

5. 5.

   Given an array of integers, how would you implement an efficient algorithm to insert an integer while maintaining order?

   Hint

   Think about using binary search to find the position first.

6. 6.

   Design a linked list structure to implement a playlist with functions to add, remove, and access songs efficiently.

   Hint

   Consider how a playlist can be represented in memory.