Algorithm efficiency basics (fast vs slow) in Intro to Computing - Quick Revision & Key Differences

Recall & Review

beginner

What does algorithm efficiency mean?

Algorithm efficiency means how fast or slow an algorithm solves a problem, usually measured by how much time or memory it uses as the input size grows.

beginner

Why is a fast algorithm better than a slow one?

A fast algorithm finishes tasks quicker, saving time and resources, especially when working with large amounts of data.

beginner

What is a real-life analogy for algorithm efficiency?

Imagine sorting books on a shelf: a fast algorithm is like quickly grouping books by color in one pass, while a slow one checks each book many times, taking longer.

intermediate

What does Big O notation describe?

Big O notation describes how the time or space an algorithm needs grows as the input size grows, helping compare efficiency without exact times.

beginner

How does input size affect algorithm speed?

As input size grows, a slow algorithm's time can increase a lot, while a fast algorithm's time grows slowly, making it better for big inputs.

Which algorithm is more efficient?

A One that uses more memory but finishes slower

B One that finishes in 10 seconds for 10 items

C One that finishes in 2 seconds for 100 items

D One that finishes in 5 seconds for 50 items

The algorithm finishing in 2 seconds for 100 items is faster and more efficient for larger input.

What does a slow algorithm usually do as input grows?

A Takes more time quickly

B Takes the same time

C Takes less time

D Stops working

Slow algorithms take more time quickly as input size increases.

Big O notation helps us understand:

A How time grows with input size

B Exact time in seconds

C How to write code

D The color of the output

Big O shows how time or space grows as input size grows.

Which is a good analogy for a fast algorithm?

A Ignoring the books

B Checking each book twice

C Reading every book fully

D Sorting books by color in one pass

Sorting books by color in one pass is quick and efficient.

Why do we care about algorithm efficiency?

A To make programs slower

B To save time and resources

C To use more memory

D To confuse users

Efficiency saves time and resources, making programs better.

Explain in your own words what makes an algorithm fast or slow.

Think about how long it takes to finish as you add more data.

Describe a real-life example that helps you understand algorithm efficiency.

Use something simple like sorting or searching in daily life.

Practice

1.

What does algorithm efficiency mainly measure?

easy

A. How fast or slow an algorithm solves a problem

B. The color of the computer screen

C. The size of the computer's hard drive

D. The number of users on a website

Solution

1. Step 1: Understand the meaning of algorithm efficiency

   Algorithm efficiency tells us how quickly or slowly an algorithm completes its task.

2. Step 2: Compare options to the definition

   Only How fast or slow an algorithm solves a problem matches the concept of speed or slowness of solving a problem.

3. Final Answer:

   How fast or slow an algorithm solves a problem -> Option A

4. Quick Check:

   Algorithm efficiency = speed of solving [OK]

Hint: Algorithm efficiency = speed of solving problems [OK]

Common Mistakes:

• Confusing efficiency with hardware specs
• Thinking efficiency is about user count
• Mixing efficiency with unrelated computer parts

2.

Which of these is a sign of a faster algorithm?

for i in range(n):
    print(i)

easy

A. The algorithm jumps directly to the middle item

B. The algorithm checks every item one by one

C. The algorithm repeats the same step many times

D. The algorithm uses more memory than needed

Solution

1. Step 1: Analyze the given code

   The code loops through all items from 0 to n-1, checking each one.

2. Step 2: Compare with options describing speed

   Jumping directly to the middle item is faster than checking all items one by one.

3. Final Answer:

   The algorithm jumps directly to the middle item -> Option A

4. Quick Check:

   Jumping steps = faster algorithm [OK]

Hint: Faster algorithms skip steps, not check all [OK]

Common Mistakes:

• Thinking looping over all items is fast
• Confusing memory use with speed
• Ignoring the benefit of skipping steps

3.

What is the output speed difference between these two algorithms when n is very large?

Algorithm 1: Check every item one by one
Algorithm 2: Jump to the middle, then half repeatedly

medium

A. Algorithm 1 is faster because it checks all items

B. Algorithm 2 is faster because it reduces steps quickly

C. Both algorithms take the same time

D. Algorithm 1 uses less memory so it is faster

Solution

1. Step 1: Understand the two algorithms

   Algorithm 1 checks all items one by one (slow for large n). Algorithm 2 jumps to the middle and halves the search repeatedly (fast for large n).

2. Step 2: Compare efficiency for large n

   Algorithm 2 reduces the number of steps quickly, making it faster than Algorithm 1.

3. Final Answer:

   Algorithm 2 is faster because it reduces steps quickly -> Option B

4. Quick Check:

   Halving steps = faster algorithm [OK]

Hint: Halving steps beats checking all [OK]

Common Mistakes:

• Assuming checking all is faster
• Ignoring step reduction benefits
• Confusing memory use with speed

4.

Find the error in this slow algorithm and suggest a faster approach:

def find_item(lst, target):
    for item in lst:
        if item == target:
            return True
    return False

medium

A. The algorithm has a syntax error in the loop

B. The algorithm uses too much memory; reduce list size

C. The algorithm returns the wrong value

D. The algorithm checks all items; use binary search on sorted list instead

Solution

1. Step 1: Identify the algorithm's behavior

   The function checks each item one by one until it finds the target or ends.

2. Step 2: Suggest a faster method

   Using binary search on a sorted list jumps to the middle and halves the search, making it faster.

3. Final Answer:

   The algorithm checks all items; use binary search on sorted list instead -> Option D

4. Quick Check:

   Linear search slow; binary search fast [OK]

Hint: Replace linear search with binary search for speed [OK]

Common Mistakes:

• Thinking syntax error exists
• Confusing memory use with speed
• Believing return value is wrong

5.

You have a list of 1,000,000 numbers sorted in order. You want to find if the number 500,000 is in the list. Which algorithm is best and why?

hard

A. Randomly pick numbers until you find 500,000

B. Check each number from start to end; simple but slow

C. Use binary search to jump and halve the search area repeatedly

D. Sort the list again before searching

Solution

1. Step 1: Understand the problem and data

   The list is sorted with 1,000,000 numbers; searching for 500,000.

2. Step 2: Evaluate algorithm choices

   Checking each number (Check each number from start to end; simple but slow) is slow. Random picking (Randomly pick numbers until you find 500,000) is unreliable. Sorting again (Sort the list again before searching) wastes time. Binary search (Use binary search to jump and halve the search area repeatedly) uses the sorted order to jump and halve search area, making it fastest.

3. Final Answer:

   Use binary search to jump and halve the search area repeatedly -> Option C

4. Quick Check:

   Sorted list + binary search = fastest search [OK]

Hint: Use binary search on sorted lists for fast lookup [OK]

Common Mistakes:

• Choosing linear search for large sorted lists
• Thinking sorting again helps
• Relying on random guessing