{"id":2722,"date":"2026-02-05T11:33:47","date_gmt":"2026-02-05T11:33:47","guid":{"rendered":"https:\/\/demo.materiamedica.net\/demo6\/?p=2722"},"modified":"2026-02-05T11:33:47","modified_gmt":"2026-02-05T11:33:47","slug":"chapter-68-swift-sorting","status":"publish","type":"post","link":"https:\/\/demo.materiamedica.net\/demo6\/chapter-68-swift-sorting\/","title":{"rendered":"Chapter 68: Swift Sorting"},"content":{"rendered":"1. The Big Picture: What does \u201csorting\u201d mean in Swift?<\/h3>\n
Sorting means rearranging the elements<\/strong> of a collection so they appear in a specific order.<\/p>\nMost common orders people want:<\/p>\n
\n- Ascending<\/strong> (small \u2192 big): 1, 3, 7, 12, 25<\/li>\n
- Descending<\/strong> (big \u2192 small): 25, 12, 7, 3, 1<\/li>\n
- Alphabetical<\/strong> (A \u2192 Z): Apple, Banana, Mango, Orange<\/li>\n
- Reverse alphabetical<\/strong> (Z \u2192 A)<\/li>\n
- Custom order<\/strong> (e.g. by priority, by distance, by recency, by user rating\u2026)<\/li>\n<\/ul>\n
Swift gives you very elegant and type-safe<\/strong> ways to sort.<\/p>\nThe two most important methods you will use every single day<\/strong>:<\/p>\n\n- sorted() \u2192 returns a new sorted array<\/strong> (original unchanged)<\/li>\n
- sort() \u2192 sorts the array in place<\/strong> (modifies the original)<\/li>\n<\/ol>\n
2. The simplest & most common cases<\/h3>\nCase 1 \u2013 Sorting numbers (ascending by default)<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
let scores = [78, 92, 65, 88, 45, 95, 72]\r\n\r\n\/\/ Returns a NEW sorted array (original unchanged)\r\nlet sortedAscending = scores.sorted()\r\nprint(sortedAscending) \/\/ [45, 65, 72, 78, 88, 92, 95]\r\n\r\n\/\/ Sort in place (modifies original array)\r\nvar mutableScores = scores\r\nmutableScores.sort()\r\nprint(mutableScores) \/\/ [45, 65, 72, 78, 88, 92, 95]<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nDescending order<\/strong> (very common):<\/p>\n\n
\n
\n
Swift<\/div>\n
\n
let descending = scores.sorted(by: >) \/\/ [95, 92, 88, 78, 72, 65, 45]\r\n\r\n\/\/ or\r\nmutableScores.sort(by: >)<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nReal tip<\/strong>: > is actually a function<\/strong> (Int, Int) -> Bool \u2014 that\u2019s why it works directly.<\/p>\nCase 2 \u2013 Sorting strings (alphabetical)<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
let names = [\"Rahul\", \"Priya\", \"Aarav\", \"Sneha\", \"Karan\", \"Meera\"]\r\n\r\nlet alphabetical = names.sorted()\r\n\/\/ [\"Aarav\", \"Karan\", \"Meera\", \"Priya\", \"Rahul\", \"Sneha\"]\r\n\r\nlet reverseAlpha = names.sorted(by: >)\r\n\/\/ [\"Sneha\", \"Rahul\", \"Priya\", \"Meera\", \"Karan\", \"Aarav\"]<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nCase-insensitive sorting<\/strong> (very important in real apps):<\/p>\n\n
\n
\n
Swift<\/div>\n
\n
let mixedCase = [\"apple\", \"Banana\", \"cherry\", \"Date\", \"apricot\"]\r\n\r\nlet caseInsensitive = mixedCase.sorted { $0.lowercased() < $1.lowercased() }\r\n\/\/ [\"apple\", \"apricot\", \"Banana\", \"cherry\", \"Date\"]<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n3. Sorting custom types (structs \/ classes) \u2014 this is where it gets really useful<\/h3>\n
Almost every real app needs to sort objects<\/strong>, not just numbers or strings.<\/p>\nStep 1 \u2013 Make your type comparable (the cleanest way)<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
struct Student {\r\n let name: String\r\n let score: Int\r\n let age: Int\r\n}\r\n\r\n\/\/ Make it Comparable \u2014 Swift will use < operator\r\nextension Student: Comparable {\r\n static func < (lhs: Student, rhs: Student) -> Bool {\r\n lhs.score < rhs.score \/\/ sort by score ascending\r\n \/\/ You can add more rules:\r\n \/\/ lhs.score != rhs.score ? lhs.score < rhs.score : lhs.age < rhs.age\r\n }\r\n}\r\n\r\nlet students = [\r\n Student(name: \"Rahul\", score: 920, age: 19),\r\n Student(name: \"Priya\", score: 980, age: 18),\r\n Student(name: \"Aarav\", score: 850, age: 20),\r\n Student(name: \"Sneha\", score: 950, age: 17)\r\n]\r\n\r\n\/\/ Now you can sort naturally\r\nlet sortedByScore = students.sorted()\r\nprint(\"Sorted by score (ascending):\")\r\nfor s in sortedByScore {\r\n print(\" \\(s.name) - \\(s.score) points, age \\(s.age)\")\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nOutput:<\/strong><\/p>\n\n
\n
\n
text<\/div>\n
\n
Sorted by score (ascending):\r\n Aarav - 850 points, age 20\r\n Rahul - 920 points, age 19\r\n Sneha - 950 points, age 17\r\n Priya - 980 points, age 18<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nStep 2 \u2013 Sort by multiple criteria (very common)<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
let sortedByScoreThenAge = students.sorted { a, b in\r\n if a.score != b.score {\r\n return a.score > b.score \/\/ higher score first\r\n }\r\n return a.age < b.age \/\/ if scores equal \u2192 younger first\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nShorter version<\/strong> (using tuple comparison):<\/p>\n\n
\n
\n
Swift<\/div>\n
\n
let sorted = students.sorted {\r\n ($0.score, $0.age) > ($1.score, $1.age) \/\/ descending score, then ascending age\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n4. Real-life examples you will actually write<\/h3>\nExample 1 \u2013 Leaderboard \/ high scores (games, quizzes)<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
struct ScoreEntry {\r\n let player: String\r\n let points: Int\r\n let date: Date\r\n}\r\n\r\nlet leaderboard = [\r\n ScoreEntry(player: \"Rahul\", points: 920, date: Date()),\r\n ScoreEntry(player: \"Priya\", points: 980, date: Date()),\r\n ScoreEntry(player: \"Aarav\", points: 850, date: Date()),\r\n ScoreEntry(player: \"Sneha\", points: 950, date: Date())\r\n]\r\n\r\n\/\/ Sort descending by points, then by date (newest first if tie)\r\nlet ranked = leaderboard.sorted { a, b in\r\n if a.points != b.points {\r\n return a.points > b.points\r\n }\r\n return a.date > b.date\r\n}\r\n\r\nprint(\"\ud83c\udfc6 Leaderboard\")\r\nfor (position, entry) in ranked.enumerated() {\r\n let rank = position + 1\r\n let rankSymbol = rank == 1 ? \"\ud83e\udd47\" : rank == 2 ? \"\ud83e\udd48\" : rank == 3 ? \"\ud83e\udd49\" : \"\\(rank).\"\r\n print(\"\\(rankSymbol) \\(entry.player) - \\(entry.points) pts\")\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nExample 2 \u2013 Sort products by price, then by name<\/h4>\n\n
\n
\n
Swift<\/div>\n
\n
struct Product {\r\n let name: String\r\n let price: Double\r\n}\r\n\r\nlet products = [\r\n Product(name: \"Earbuds Pro\", price: 24999),\r\n Product(name: \"Phone Case\", price: 999),\r\n Product(name: \"Charger\", price: 2499),\r\n Product(name: \"Earbuds\", price: 9999)\r\n]\r\n\r\nlet sortedProducts = products.sorted { a, b in\r\n if a.price != b.price {\r\n return a.price < b.price \/\/ cheapest first\r\n }\r\n return a.name < b.name \/\/ if price equal \u2192 alphabetical\r\n}\r\n\r\nprint(\"Products sorted by price, then name:\")\r\nfor p in sortedProducts {\r\n print(\" \u20b9\\(String(format: \"%.0f\", p.price)) \u2013 \\(p.name)\")\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n5. Very Common Beginner Mistakes & Fixes<\/h3>\n\n
\n
\n\n\n| Mistake<\/th>\n | Wrong \/ Dangerous code<\/th>\n | Correct \/ Better habit<\/th>\n | Why?<\/th>\n<\/tr>\n<\/thead>\n |
\n\n| Mutating array while sorting<\/td>\n | array.sort { \u2026 } then keep using old reference<\/td>\n | let sorted = array.sorted { \u2026 }<\/td>\n | sort() mutates, sorted() returns new<\/td>\n<\/tr>\n |
\n| Force-unwrapping inside sort closure<\/td>\n | sorted { $0!.score < $1!.score }<\/td>\n | Use compactMap first or optional chaining<\/td>\n | Crash if any nil<\/td>\n<\/tr>\n |
\n| Sorting optional values without handling nil<\/td>\n | sorted { $0 < $1 } on [Int?]<\/td>\n | sorted { $0 ?? 0 < $1 ?? 0 } or filter nils<\/td>\n | nil crashes comparison<\/td>\n<\/tr>\n |
\n| Wrong comparator direction<\/td>\n | sorted { $0.score < $1.score } for descending<\/td>\n | sorted { $0.score > $1.score }<\/td>\n | Easy to mix up ascending\/descending<\/td>\n<\/tr>\n |
\n| Not using sorted(by:) when logic is complex<\/td>\n | sorted() on custom type<\/td>\n | sorted { a, b in \u2026 } with clear rules<\/td>\n | Default Comparable may not be what you want<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n 6. Quick Reference \u2013 Sorting cheat sheet<\/h3>\n\n \n \n\n\n| Goal<\/th>\n | Most idiomatic code<\/th>\n | Notes \/ Tip<\/th>\n<\/tr>\n<\/thead>\n | \n\n| Numbers ascending<\/td>\n | array.sorted() or array.sorted(by: <)<\/td>\n | Default is ascending<\/td>\n<\/tr>\n | \n| Numbers descending<\/td>\n | array.sorted(by: >)<\/td>\n | Very common<\/td>\n<\/tr>\n | \n| Strings case-insensitive<\/td>\n | sorted { $0.lowercased() < $1.lowercased() }<\/td>\n | Handles “Apple” vs “banana” correctly<\/td>\n<\/tr>\n | \n| Custom struct by one property<\/td>\n | sorted { $0.score > $1.score }<\/td>\n | Descending score<\/td>\n<\/tr>\n | \n| Custom struct by multiple properties<\/td>\n | sorted { ($0.score, $0.age) > ($1.score, $1.age) }<\/td>\n | Score descending, then age ascending<\/td>\n<\/tr>\n | \n| Keep original unchanged<\/td>\n | let sorted = array.sorted { \u2026 }<\/td>\n | sorted() returns new array<\/td>\n<\/tr>\n | \n| Sort in place (modify original)<\/td>\n | array.sort { \u2026 }<\/td>\n | Use only when you don\u2019t need the old order<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n 7. Small Practice \u2013 Try these<\/h3>\n\n- Create array of 6 numbers \u2192 Sort them ascending \u2192 Sort them descending<\/li>\n
- Create array of 5 names (mixed case) \u2192 Sort them alphabetically (case-insensitive)<\/li>\n
- Create array of structs: struct Product { let name: String; let price: Double } \u2192 Sort by price ascending, then by name alphabetical if prices equal<\/li>\n<\/ol>\n
Paste your code here if you want feedback or want to see even cleaner versions!<\/p>\n What would you like to explore next?<\/p>\n \n- Sorting<\/strong> with multiple criteria<\/strong> in more depth<\/li>\n
- Sorting<\/strong> custom types with Comparable conformance<\/li>\n
- Sorting<\/strong> in SwiftUI<\/strong> (sorted lists, @State updates)<\/li>\n
- Array slicing<\/strong> & memory behavior<\/li>\n
- Collections in SwiftUI<\/strong> (List, ForEach, diffable data sources)<\/li>\n
- Or move to another topic (dictionaries, sets, optionals, switch\u2026)<\/li>\n<\/ul>\n
Just tell me \u2014 we\u2019ll continue in the same clear, detailed, patient style \ud83d\ude0a<\/p>\n","protected":false},"excerpt":{"rendered":" 1. The Big Picture: What does \u201csorting\u201d mean in Swift? Sorting means rearranging the elements of a collection so they appear in a specific order. Most common orders people want: Ascending (small \u2192 big):...<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[76],"tags":[],"class_list":["post-2722","post","type-post","status-publish","format-standard","hentry","category-swift"],"_links":{"self":[{"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/posts\/2722","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/comments?post=2722"}],"version-history":[{"count":1,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/posts\/2722\/revisions"}],"predecessor-version":[{"id":2723,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/posts\/2722\/revisions\/2723"}],"wp:attachment":[{"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/media?parent=2722"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/categories?post=2722"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demo.materiamedica.net\/demo6\/wp-json\/wp\/v2\/tags?post=2722"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} | |