What if you could sort any list exactly how you want with just one simple line of code?
Why Sorted and custom comparators in Swift? - Purpose & Use Cases
Imagine you have a messy list of names or numbers, and you want to put them in order by hand. You try to compare each item one by one, writing lots of code to check who comes first or which number is bigger.
Doing this manually is slow and confusing. You might forget a rule or make mistakes, especially if the sorting rules are tricky, like sorting by last name, then first name, or sorting numbers in a special way.
Using sorted functions with custom comparators lets you tell the computer exactly how to compare items. It handles all the hard work quickly and correctly, so you get a neat, ordered list without the headache.
var sortedList = list for i in 0..<sortedList.count { for j in i+1..<sortedList.count { if sortedList[i] > sortedList[j] { let temp = sortedList[i] sortedList[i] = sortedList[j] sortedList[j] = temp } } }
let sortedList = list.sorted { $0 < $1 }You can easily sort complex data exactly how you want, making your programs smarter and your code cleaner.
Think about sorting a contact list by last name, then by first name, or sorting products by price and rating to show the best options first.
Manual sorting is slow and error-prone.
Custom comparators let you define clear sorting rules.
Sorted functions make ordering data easy and reliable.
Practice
sorted(by:) method do in Swift?Solution
Step 1: Understand the purpose of
This method sorts elements of an array based on a closure that defines the order.sorted(by:)Step 2: Compare with other array methods
Unlike filtering or reversing,sorted(by:)changes order based on a custom rule.Final Answer:
It sorts an array using a custom rule you provide. -> Option AQuick Check:
sorted(by:)= custom sorting [OK]
- Confusing sorting with filtering
- Thinking it removes duplicates
- Assuming it reverses the array
sorted(by:)?Solution
Step 1: Understand sorting order
To sort descending, the comparator must return true when the first element is greater than the second.Step 2: Check each option
let sortedArray = numbers.sorted(by: { $0 > $1 }) uses { $0 > $1 } which sorts descending. let sortedArray = numbers.sorted(by: { $0 < $1 }) sorts ascending. let sortedArray = numbers.sorted() sorts ascending by default. let sortedArray = numbers.sorted(by: { $1 > $0 }) reverses the comparison incorrectly.Final Answer:
let sortedArray = numbers.sorted(by: { $0 > $1 }) -> Option DQuick Check:
Descending sort uses $0 > $1 [OK]
- Using $0 < $1 for descending
- Forgetting to provide closure for custom order
- Confusing parameter order in closure
let names = ["Anna", "Bob", "Charlie"]
let sortedNames = names.sorted(by: { $0.count < $1.count })
print(sortedNames)Solution
Step 1: Understand the sorting rule
The closure sorts by string length ascending: shorter names come first.Step 2: Apply sorting to the array
"Bob" has 3 letters, "Anna" 4, "Charlie" 7. So order is ["Bob", "Anna", "Charlie"].Final Answer:
["Bob", "Anna", "Charlie"] -> Option BQuick Check:
Sort by length ascending = ["Bob", "Anna", "Charlie"] [OK]
- Sorting alphabetically instead of by length
- Confusing < with > in closure
- Expecting original order
let items = [("a", 3), ("b", 1), ("c", 2)]
let sortedItems = items.sorted(by: { $0.1 > $1.1 })
print(sortedItems)Solution
Step 1: Check tuple access syntax
Accessing tuple elements by $0.1 and $1.1 is correct in Swift closures.Step 2: Verify sorting closure logic
The closure returns true if first element's second value is greater, sorting descending by second value.Final Answer:
There is no error; the code sorts descending by second value. -> Option AQuick Check:
Tuple access and Bool return are correct [OK]
- Thinking tuple elements can't be accessed by index
- Expecting closure to return Int
- Confusing ascending and descending order
let people = [["name": "Alice", "age": 30], ["name": "Bob", "age": 25], ["name": "Charlie", "age": 30]]. How do you sort this array first by age ascending, then by name ascending if ages are equal?Solution
Step 1: Understand sorting by multiple keys
Sorting by age ascending, then name ascending means comparing tuples of (age, name).Step 2: Check each option's logic
people.sorted { ($0["age"] as! Int, $0["name"] as! String) < ($1["age"] as! Int, $1["name"] as! String) } compares tuples directly, which sorts by age first, then name if ages equal. people.sorted { $0["age"] as! Int < $1["age"] as! Int && $0["name"] as! String < $1["name"] as! String } uses && which fails for correct ordering. people.sorted(by: { $0["age"] as! Int > $1["age"] as! Int || $0["name"] as! String > $1["name"] as! String }) sorts descending and mixes conditions incorrectly. people.sorted(by: { $0["name"] as! String < $1["name"] as! String }) sorts only by name.Final Answer:
people.sorted { ($0["age"] as! Int, $0["name"] as! String) < ($1["age"] as! Int, $1["name"] as! String) } -> Option CQuick Check:
Tuple comparison sorts by multiple keys [OK]
- Using && instead of tuple comparison
- Sorting only by one key
- Mixing ascending and descending incorrectly
Ready to prove it?
Pass the test and this pattern moves unknown
