Arrays vs Other Data Structures When to Choose Arrays in DSA C++ - Build Both Approaches

Arrays vs Other Data Structures: When to Choose Arrays

📖 Scenario: Imagine you are organizing a small library shelf with books. You want to keep track of the books in a simple, straight line so you can quickly find a book by its position. This is like using an array.Sometimes, you might want to organize books differently, like by categories or authors, which needs other data structures. But for simple, fixed lists, arrays are great!

🎯 Goal: You will create a simple array of book titles, then decide how many books you want to keep track of, and finally print the list of books. This will help you understand when arrays are the best choice.

📋 What You'll Learn

Create an array of exactly 5 book titles using std::string books[5]

Create an integer variable numberOfBooks to store how many books are currently on the shelf

Use a for loop with variable i to print all book titles up to numberOfBooks

Print the list of books exactly as shown in the example output

💡 Why This Matters

🌍 Real World

Arrays are used in many real-world programs where data is stored in a fixed order, like storing daily temperatures, scores in a game, or a list of names.

💼 Career

Understanding arrays is fundamental for programming jobs because they are the building blocks for more complex data structures and algorithms.

1

Create an array of 5 book titles

Create an array called books of type std::string with exactly 5 book titles: "The Hobbit", "1984", "Pride and Prejudice", "To Kill a Mockingbird", and "The Great Gatsby".

DSA C++

#include 
#include 

int main() {
    // Create the array books with 5 titles
    // Your code here
}

Hint

Use std::string books[5] = { ... }; to create the array with the exact titles inside curly braces.

2

Add a variable to store the number of books

Add an integer variable called numberOfBooks and set it to 5 to represent how many books are currently on the shelf.

DSA C++

#include 
#include 

int main() {
    std::string books[5] = {"The Hobbit", "1984", "Pride and Prejudice", "To Kill a Mockingbird", "The Great Gatsby"};
    // Create numberOfBooks variable and set it to 5
    // Your code here
}

Hint

Use int numberOfBooks = 5; to create the variable.

3

Print all book titles using a for loop

Use a for loop with variable i starting from 0 up to but not including numberOfBooks to print each book title from the books array on its own line.

DSA C++

#include 
#include 

int main() {
    std::string books[5] = {"The Hobbit", "1984", "Pride and Prejudice", "To Kill a Mockingbird", "The Great Gatsby"};
    int numberOfBooks = 5;
    // Use a for loop to print each book title
    // Your code here
}

Hint

Use for (int i = 0; i < numberOfBooks; i++) and inside the loop print books[i].

4

Print the final list of books

Print the list of books exactly as shown by running the program. The output should show each book title on its own line in the order stored in the array.

DSA C++

#include 
#include 

int main() {
    std::string books[5] = {"The Hobbit", "1984", "Pride and Prejudice", "To Kill a Mockingbird", "The Great Gatsby"};
    int numberOfBooks = 5;
    for (int i = 0; i < numberOfBooks; i++) {
        std::cout << books[i] << std::endl;
    }
    // Program output is the list of books
    // Your code here
}

Hint

Run the program to see the list of books printed line by line.

Practice

1. Which of the following is the best reason to choose an array over other data structures like linked lists or trees?

easy

A. When you need fast access to elements by index

B. When you want to easily insert or delete elements anywhere

C. When you need a flexible size that grows automatically

D. When you want to store key-value pairs

Solution

1. Step 1: Understand array access speed

   Arrays store elements in continuous memory, so accessing by index is very fast (constant time).

2. Step 2: Compare with other structures

   Linked lists and trees have slower access by index because they require traversal.

3. Final Answer:

   When you need fast access to elements by index -> Option A

4. Quick Check:

   Array index access: O(1) [OK]

Hint: Arrays give quick index access, unlike linked lists [OK]

Common Mistakes:

• Thinking arrays allow easy insertion/deletion anywhere
• Confusing arrays with dynamic size structures
• Assuming arrays store key-value pairs

2. Which of the following is the correct way to declare an array of 5 integers in C++?

easy

A. int arr(5);

B. int arr = new int[5];

C. int arr[5];

D. array<int> arr(5);

Solution

1. Step 1: Recall C++ array syntax

   Static arrays in C++ are declared with type, name, and size in square brackets.

2. Step 2: Check each option

   int arr[5]; uses correct syntax: int arr[5];. int arr = new int[5]; is incorrect syntax for static arrays. int arr(5); is invalid for arrays. array<int> arr(5); uses a non-standard syntax.

3. Final Answer:

   int arr[5]; -> Option C

4. Quick Check:

   Static array uses square brackets [OK]

Hint: Use square brackets for static array size in C++ [OK]

Common Mistakes:

• Using parentheses instead of square brackets
• Confusing dynamic allocation syntax with static arrays
• Using non-standard array declarations

3. What will be the output of the following C++ code?

int arr[3] = {10, 20, 30};
for (int i = 0; i < 3; i++) {
    std::cout << arr[i] << " ";
}

medium

A. 10 20 30

B. 30 20 10

C. 0 0 0

D. Compilation error

Solution

1. Step 1: Analyze array initialization

   The array arr is initialized with values 10, 20, 30 at indices 0, 1, 2 respectively.

2. Step 2: Trace the loop output

   The loop prints elements from index 0 to 2, so output is "10 20 30 " with spaces.

3. Final Answer:

   10 20 30 -> Option A

4. Quick Check:

   Loop from 0 to < size prints forward [OK]

Hint: Arrays print in stored order unless reversed [OK]

Common Mistakes:

• Assuming reverse order print
• Thinking uninitialized arrays print zeros
• Expecting syntax errors from correct code

4. Identify the error in the following code snippet that uses an array:

int arr[3];
arr[3] = 100;
std::cout << arr[3];

medium

A. Missing semicolon after declaration

B. Array index out of bounds error

C. Syntax error in array declaration

D. No error, code runs fine

Solution

1. Step 1: Check array size and indexing

   The array arr has size 3, so valid indices are 0, 1, 2.

2. Step 2: Identify invalid access

   Accessing arr[3] is out of bounds and causes undefined behavior.

3. Final Answer:

   Array index out of bounds error -> Option B

4. Quick Check:

   Valid indices: 0 <= i < size [OK]

Hint: Array indices start at 0, max index = size-1 [OK]

Common Mistakes:

• Assuming index 3 is valid for size 3 array
• Ignoring runtime errors from invalid access
• Confusing syntax errors with runtime errors

5. You need to store a fixed number of student grades and access them quickly by their position. Which data structure should you choose and why?

medium

A. Linked list, because it allows easy insertion and deletion

B. Binary tree, because it keeps data sorted automatically

C. Hash map, because it stores key-value pairs efficiently

D. Array, because it provides fast index-based access and fixed size

Solution

1. Step 1: Understand the problem requirements

   The number of grades is fixed and access by position (index) should be fast.

2. Step 2: Match data structure properties

   Arrays have fixed size and provide constant time access by index, perfect for this need.

3. Step 3: Compare other options

   Linked lists are slow for index access, hash maps are for key-value pairs, and binary trees are for sorted data.

4. Final Answer:

   Array, because it provides fast index-based access and fixed size -> Option D

5. Quick Check:

   Fast index access + fixed size: array [OK]

Hint: Fixed size + fast access = array choice [OK]

Common Mistakes:

• Choosing linked list for fast index access
• Confusing hash map use case with arrays
• Selecting binary tree without sorting need