Why collection algorithms matter in Swift - Performance Analysis

Time Complexity: Why collection algorithms matter

O(n)

Understanding Time Complexity

When working with collections like arrays or lists, the way we search, sort, or filter them affects how fast our program runs.

We want to know how the time needed changes as the collection gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

let numbers = [1, 3, 5, 7, 9]

func containsNumber(_ target: Int, in array: [Int]) -> Bool {
    for number in array {
        if number == target {
            return true
        }
    }
    return false
}

let result = containsNumber(5, in: numbers)
    

This code checks if a number exists in an array by looking at each item one by one.

Identify Repeating Operations

• Primary operation: Looping through the array elements one by one.
• How many times: Up to once for each item until the target is found or the end is reached.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	Up to 10 checks
100	Up to 100 checks
1000	Up to 1000 checks

Pattern observation: The number of checks grows directly with the size of the array.

Final Time Complexity

Time Complexity: O(n)

This means the time to find a number grows in a straight line as the list gets bigger.

Common Mistake

[X] Wrong: "Searching an unsorted list is always fast because computers are quick."

[OK] Correct: Even fast computers need to check each item one by one if the list is unsorted, so bigger lists take more time.

Interview Connect

Understanding how collection algorithms grow with input size helps you explain your choices clearly and shows you know how to write efficient code.

Self-Check

"What if the array was sorted and we used a method that splits the search area in half each time? How would the time complexity change?"

Practice

1. Why are collection algorithms important when working with data in Swift?

easy

A. They help find, sort, and filter data easily and efficiently.

B. They make the app run slower by adding extra steps.

C. They only work with numbers, not text or objects.

D. They require complex code that is hard to read.

Solution

1. Step 1: Understand the purpose of collection algorithms

   Collection algorithms are designed to help manage data by finding, sorting, filtering, and checking items quickly.

2. Step 2: Evaluate the options based on this purpose

   They help find, sort, and filter data easily and efficiently. correctly states their role in making data handling easier and efficient. Other options describe incorrect or negative effects.

3. Final Answer:

   They help find, sort, and filter data easily and efficiently. -> Option A

4. Quick Check:

   Collection algorithms improve data handling = B [OK]

Hint: Remember: algorithms simplify data tasks fast [OK]

Common Mistakes:

• Thinking algorithms slow down the app
• Believing algorithms only work with numbers
• Assuming algorithms make code complex

2. Which of the following is the correct way to use the filter algorithm on an array numbers to get only even numbers in Swift?

easy

A. let evens = numbers.filter { $0 / 2 == 0 }

B. let evens = numbers.filter { $0 % 2 == 0 }

C. let evens = numbers.filter { $0 % 2 = 0 }

D. let evens = numbers.filter { $0 == 2 }

Solution

1. Step 1: Understand the filter syntax in Swift

   The filter method takes a closure that returns true for elements to keep. The condition for even numbers is number % 2 == 0.

2. Step 2: Check each option for correct syntax and logic

   let evens = numbers.filter { $0 % 2 == 0 } uses the correct modulo operator and comparison. let evens = numbers.filter { $0 / 2 == 0 } uses division incorrectly. let evens = numbers.filter { $0 % 2 = 0 } uses assignment (=) instead of comparison (==). let evens = numbers.filter { $0 == 2 } filters only numbers equal to 2, not all evens.

3. Final Answer:

   let evens = numbers.filter { $0 % 2 == 0 } -> Option B

4. Quick Check:

   Correct filter syntax for evens = A [OK]

Hint: Use % 2 == 0 to find even numbers in filter [OK]

Common Mistakes:

• Using / instead of % for even check
• Using = instead of == in condition
• Filtering only one number instead of all evens

3. What will be the output of this Swift code?

let names = ["Anna", "Bob", "Cathy", "David"]
let result = names.contains { $0.hasPrefix("C") }
print(result)

medium

A. nil

B. false

C. SyntaxError

D. true

Solution

1. Step 1: Understand the contains method with a closure

   The contains method checks if any element satisfies the condition. Here, it checks if any name starts with "C".

2. Step 2: Check the array elements for the condition

   "Cathy" starts with "C", so the condition is true, making result true.

3. Final Answer:

   true -> Option D

4. Quick Check:

   names contains prefix "C" = true [OK]

Hint: contains with closure returns true if any match found [OK]

Common Mistakes:

• Thinking contains checks all elements and returns false if any fail
• Confusing hasPrefix with contains
• Expecting syntax error due to closure

4. Identify the error in this Swift code that tries to sort an array of integers:

let numbers = [3, 1, 4, 2]
let sorted = numbers.sorted(by: { a, b in a > b })
print(sorted)

medium

A. The closure should use '<' instead of '>' to sort ascending.

B. The sorted method cannot take a closure.

C. The array must be mutable to sort.

D. The closure parameters must be named 'x' and 'y'.

Solution

1. Step 1: Understand the sorted(by:) closure logic

   The closure defines the sorting order. Using 'a > b' sorts descending, not ascending.

2. Step 2: Identify the intended sort order

   Since the question implies sorting ascending, the closure should use 'a < b'. Other options are incorrect because sorted can take closures, arrays can be immutable for sorted, and parameter names are flexible.

3. Final Answer:

   The closure should use '<' instead of '>' to sort ascending. -> Option A

4. Quick Check:

   Use '<' for ascending sort closure [OK]

Hint: Use '<' in closure for ascending sort [OK]

Common Mistakes:

• Thinking sorted needs mutable array
• Believing closure parameter names are fixed
• Assuming sorted can't take closures

5. You have a list of user scores: let scores = [10, 0, 5, 0, 8]. You want to create a dictionary where keys are the scores and values are the count of how many times each score appears, but you want to ignore zero scores. Which Swift code correctly uses collection algorithms to do this?

hard

A. let counts = scores.filter { $0 == 0 }.count

B. let counts = Dictionary(uniqueKeysWithValues: scores.map { ($0, 1) })

C. let counts = Dictionary(grouping: scores.filter { $0 != 0 }, by: { $0 }).mapValues { $0.count }

D. let counts = scores.reduce(into: [:]) { $0[$1] = 1 }

Solution

1. Step 1: Filter out zero scores

   The code filters scores to exclude zeros using filter { $0 != 0 }.

2. Step 2: Group remaining scores and count occurrences

   Using Dictionary(grouping:by:) groups scores by value, then mapValues { $0.count } counts how many times each score appears.

3. Final Answer:

   let counts = Dictionary(grouping: scores.filter { $0 != 0 }, by: { $0 }).mapValues { $0.count } -> Option C

4. Quick Check:

   Filter zeros, group by score, count occurrences = D [OK]

Hint: Filter zeros first, then group and count [OK]

Common Mistakes:

• Using uniqueKeysWithValues which overwrites duplicates
• Not filtering zeros before counting
• Using reduce incorrectly without counting