Chapters

Chapters

Data Structures & Algorithms in Swift

1 min

Before You Begin

Section 0: 6 chapters

Section I: Introduction

Section 1: 3 chapters

1. Why Learn Data Structures & Algorithms?

2. Complexity

3. Swift Standard Library

Section II: Elementary Data Structures

Section 2: 6 chapters

4. Stacks

5. Stack Challenges

6. Linked Lists

7. Linked List Challenges

8. Queues

9. Queue Challenges

Section III: Trees

Section 3: 16 chapters

10. Trees

11. Tree Challenges

12. Binary Trees

13. Binary Tree Challenges

14. Binary Search Trees

15. Binary Search Tree Challenges

16. AVL Trees

17. AVL Tree Challenges

18. Tries

19. Trie Challenges

20. Binary Search

21. Binary Search Challenges

22. Heaps

23. Heap Challenges

24. Priority Queues

25. Priority Queue Challenges

Section IV: Sorting Algorithms

Section 4: 10 chapters

26. O(n²) Sorting Algorithms

27. O(n²) Sorting Challenges

28. Merge Sort

29. Merge Sort Challenges

30. Radix Sort

31. Radix Sort Challenges

32. Heapsort

33. Heapsort Challenges

34. Quicksort

35. Quicksort Challenges

Section V: Graphs

Section 5: 11 chapters

36. Graphs

37. Graph Challenges

38. Breadth-First Search

39. Breadth-First Search Challenges

40. Depth-First Search

41. Depth-First Search Challenges

42. Dijkstra’s Algorithm

43. Dijkstra’s Algorithm Challenges

44. Prim’s Algorithm

45. Prim’s Algorithm Challenges

46. Conclusion

iii. Dedications

“To my team, family, and friends.”

— Kelvin Lau

“To my friends and family who I know will never read this book.”

— Vincent Ngo

Have a technical question? Want to report a bug? You can ask questions and report bugs to the book authors in our official book forum here.

© 2023 Kodeco Inc.