Why Arrays Exist and What Problem They Solve in DSA Typescript - Performance Analysis

Time Complexity: Why Arrays Exist and What Problem They Solve

O(1) for access/update, O(n) for looping

Understanding Time Complexity

Arrays help us store many items in order so we can find and use them easily.

We want to know how fast we can get or change items in an array as it grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

const arr: number[] = [10, 20, 30, 40, 50];

// Access the third element
const value = arr[2];

// Update the first element
arr[0] = 15;

// Loop through all elements
for (let i = 0; i < arr.length; i++) {
  console.log(arr[i]);
}
    

This code shows accessing, updating, and looping through an array of numbers.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing or updating an element by index is done instantly.
• How many times: Access and update happen once each; looping goes through all elements once.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	10 (looping through all 10 items)
100	100 (looping through all 100 items)
1000	1000 (looping through all 1000 items)

Pattern observation: Access or update one item stays quick no matter size, but looping takes longer as array grows.

Final Time Complexity

Time Complexity: O(1) for access/update, O(n) for looping

This means getting or changing one item is very fast, but checking all items takes longer as the array grows.

Common Mistake

[X] Wrong: "Accessing any item in an array takes longer if the array is bigger."

[OK] Correct: Arrays let us jump straight to any item by its position, so access time stays the same no matter the size.

Interview Connect

Understanding how arrays let us quickly find and change items helps you explain why they are a basic and powerful tool in programming.

Self-Check

"What if we used a linked list instead of an array? How would the time complexity for accessing an item change?"

Practice

1. Why do arrays exist in programming languages like TypeScript?

easy

A. To store multiple values in a single, ordered collection

B. To perform mathematical calculations automatically

C. To replace all other data structures like trees and graphs

D. To store only one value at a time

Solution

1. Step 1: Understand the purpose of arrays

   Arrays are designed to hold many values together in one place, keeping them in order.

2. Step 2: Compare with other options

   Options A, B, and D do not describe arrays correctly. Arrays do not perform calculations automatically, do not replace all data structures, and can hold more than one value.

3. Final Answer:

   To store multiple values in a single, ordered collection -> Option A

4. Quick Check:

   Arrays store many values in order = C [OK]

Hint: Arrays hold many values together in order [OK]

Common Mistakes:

• Thinking arrays store only one value
• Confusing arrays with calculation tools
• Believing arrays replace all data structures

2. Which of the following is the correct way to declare an array of numbers in TypeScript?

easy

A. let nums: number[] = [1, 2, 3];

B. let nums = (1, 2, 3);

C. let nums: number = [1, 2, 3];

D. let nums: array = 1, 2, 3;

Solution

1. Step 1: Check TypeScript array syntax

   In TypeScript, arrays are declared with type followed by square brackets, e.g., number[].

2. Step 2: Validate each option

   let nums: number[] = [1, 2, 3]; uses correct syntax. Options B, C, and D have syntax errors or wrong type declarations.

3. Final Answer:

   let nums: number[] = [1, 2, 3]; -> Option A

4. Quick Check:

   Correct array syntax = A [OK]

Hint: Use type[] to declare arrays in TypeScript [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Assigning array to a single number type
• Incorrect type keyword usage

3. What will be the output of the following TypeScript code?

const arr = [10, 20, 30];
arr.push(40);
console.log(arr);

medium

A. [10, 20, 30]

B. [10, 20, 30, 40]

C. [40, 10, 20, 30]

D. Error: push is not a function

Solution

1. Step 1: Understand the push method

   The push method adds a new element to the end of the array.

2. Step 2: Apply push to the array

   Starting with [10, 20, 30], pushing 40 results in [10, 20, 30, 40].

3. Final Answer:

   [10, 20, 30, 40] -> Option B

4. Quick Check:

   push adds element at end = D [OK]

Hint: push adds element to array end [OK]

Common Mistakes:

• Thinking push adds element at start
• Expecting original array unchanged
• Confusing push with pop

4. Identify the error in this TypeScript code that tries to create an array and add an element:

let numbers = 5;
numbers.push(10);

medium

A. Array must be declared with 'const' keyword

B. push method requires two arguments

C. Variable 'numbers' is not an array, so push method is invalid

D. Numbers cannot be stored in arrays

Solution

1. Step 1: Check variable type

   Variable 'numbers' is assigned a single number, not an array.

2. Step 2: Understand push method usage

   push is a method for arrays only, so calling it on a number causes an error.

3. Final Answer:

   Variable 'numbers' is not an array, so push method is invalid -> Option C

4. Quick Check:

   push only works on arrays = A [OK]

Hint: push works only on arrays, not single values [OK]

Common Mistakes:

• Assuming push works on numbers
• Thinking push needs multiple arguments
• Believing arrays must be const

5. You want to store daily temperatures for a week and quickly access any day's temperature by its position. Which data structure solves this problem best and why?

hard

A. Linked list, because it uses less memory than arrays

B. Stack, because it stores data in last-in-first-out order

C. Set, because it automatically removes duplicate temperatures

D. Array, because it stores values in order and allows fast access by index

Solution

1. Step 1: Identify the need for ordered storage and fast access

   Storing temperatures by day means order matters and quick access by position is needed.

2. Step 2: Compare data structures

   Arrays keep order and allow direct access by index, making them ideal. Linked lists have slower access, sets remove duplicates (not needed), stacks use LIFO order which is not suitable.

3. Final Answer:

   Array, because it stores values in order and allows fast access by index -> Option D

4. Quick Check:

   Ordered fast access = Array = B [OK]

Hint: Use arrays for ordered data with fast index access [OK]

Common Mistakes:

• Choosing linked list for fast access
• Using set which removes duplicates unnecessarily
• Selecting stack which reverses order