go back to main content index

1. Introduction AADS Swift

1. 1. Introduction

2. The Big-O Notation

At a glance: Notes

1. 1. Constant Time Complexity
   • BenchTimer
2. 2. Linear Time Complexity
3. 3. Quadratic Time Complexity
4. 4. Hints of polinomial Time Complexity
5. 5. Logarithmic Time
6. 6. Summary

3. Recursion AADS Swift

At a glance: Notes

1. 1. What is recursion?
2. 2. How Does Recursion Work?
3. 3. Recursion Pitfalls
4. 4. How to Avoid Infinite Recursion

4. The Power Of Algorithms

At a glance: Notes

1. 1. Calculate Sum(n)
2. 2. Pair Matching Challenge
3. 3. Find the Equilibrium Index
4. 4. Summary

5. Generics

At a glance: Notes

1. 1. Why Generics?
2. 2. Generic Types
3. 3. Generic Functions

6. The Build-In Swift collection Types

At a glance: Notes

1. 1. The Array
2. 2. Accessing the Array
3. 3. Modifying the Array
4. 4. The Set
5. 5. Accesing and Modifying the Set
6. 6. Set Operations
   • Union
   • Intersection
   • Subtract
   • Simmetric Difference
7. 7. The Hashable Protocol
8. 8. The Dictionary
9. 9. Creating Dictionaries
10. 10. Heterogeneous Dictionaries
11. 11. Accesing & Modifying the contents of a Dictionary

7. Basic Sorting

At a glance: Notes

1. 1. Selection Sort
   • Selection Sort Implementation
   • Selection Sort Time Complexity
   • Conclusions for Selection Sort
2. 2. Insertion Sort
   • Insertion Sort Implementation
   • Insertion Sort Time Complexity
   • Conclusions for Insertion Sort
3. 3. Insertion Sort vs Selection Sort
   • Conclusions for I vs S algorithm
4. 4. Bubble Sort
   • Bubble Sort Implementation
   • Bubble Sort Time Complexity
   • Conclusions for Bubble Sort
5. 5. Bubble vs Insertion vs Selection Sort
   • Conclusions for B vs I sort algorithm

8. Advance Sorting

At a glance: Notes

1. 1. The merge sort
   • Implementation Merge Sort
2. 2. QuickSort
   • Implementation QuickSort