ALGO - Lesson 4 (Data Structure)

Organization of data to be used efficiently.

• Data Structure

• Data Storage

• Data Organization

Amount of time an algorithm takes to run

(as the size of the problem/input increases).

• Time Complexity

• Space Complexity

Amount of memory an algorithm uses

(as the size of the problem/input increases).

• Time Complexity

• Space Complexity

Focuses on the speed of an algorithm.

• Time Complexity

• Space Complexity

Focuses on the memory usage of an algorithm.

• Time Complexity

• Space Complexity

How big the instruction is.

• Time Complexity

• Space Complexity

BUT, in an ideal algo, ____________ is the only variable to be focused on.

• Time Complexity

• Space Complexity

WHY? In an ideal algo, time complexity is the only variable to be focused on.

- Because in an ideal world, we want our algorithms to be ___________, so focusing on time complexity makes sense.

• as fast as possible

• as slow as possible

• as efficient as possible

• as helpful as possible

WHY? In an ideal algo, time complexity is the only variable to be focused on.

- An algorithm that runs faster is often seen as more "_______", even if it uses more memory.

• efficient

• slower

• helpful

WHY? In an ideal algo, time complexity is the only variable to be focused on.

- An algorithm with a __________ is often preferred, even if it has a __________________.

• lower time complexity, higher space complexity

• higher time complexity, lower space complexity

• lower space complexity, higher time complexity

• higher space complexity, lower time complexity