Why data structures matter for efficiency in Intro to Computing - Draw It to Prove It

Draw This - beginner

Draw a simple diagram comparing how quickly you can find a book in two different ways: (1) a messy pile of books (like an unsorted list), and (2) a neatly arranged bookshelf with labels (like a sorted array). Show the steps you take in each case to find the book titled 'Data Structures'.

10 minutes

Hint 1

Hint 2

Hint 3

Grading Criteria

Two distinct methods shown: messy pile and neatly arranged shelf

Steps for searching clearly indicated for both methods

Labels or titles used to identify books

Comparison of search effort visible (many steps vs few steps)

Diagram is clear and easy to follow

Solution

Data Science

→Algorithms

↓

Algorithms

This diagram shows two ways to find a book called 'Data Structures'.

In the messy pile (like an unsorted list), you must check each book one by one until you find the right one. This takes more time because you might check many books.

In the neatly arranged bookshelf (like a sorted array), books are organized and labeled. You can quickly jump to the book you want without checking others, saving time.

This example explains why choosing the right data structure matters for efficiency: some structures let you find things faster.

Variations - 2 Challenges

[intermediate] Draw a flowchart showing how searching for a phone number differs between a list of contacts in random order and a phonebook sorted alphabetically.

[advanced] Draw a diagram comparing how inserting a new contact differs in an unsorted list versus a balanced tree data structure.