A Common-Sense Guide to Data Structures and Algorithms in Python, Volume 1

Chapter 1

These are the solutions to the exercises found in the section ​Exercises​.

1. Let’s break down each of the cases:

   1. Reading from an array always takes just one step.

   2. Searching for a nonexistent element within an array of size 100 will take 100 steps, as the computer needs to inspect each element of the array before determining the element cannot be found.

   3. The insertion will take 101 steps: 100 shifts of each element to the right, and one step to insert the new element at the front of the array.

   4. Insertion at the end of an array always takes one step.

   5. The deletion will take 100 steps: first the computer deletes the first element and then shifts the remaining 99 elements to the left, one at a time.

   6. Deletion at the end of an array always takes ...