README.md

go back to main content index

1. Introduction

1. Introduction

2. The Big-O Notation

At a glance: Notes

1. 1. Constant Time Complexity
   • BenchTimer
   • Takes an array and checks whether the first element is 0
     • Test a very small array
     • Test a medium Array
     • Test a huge array
     • Hash-map look up Execution and results
   • Hash-map LookUp
     • Create a method to generate dictionaries
     • Test a very small dictionary
     • Test a medium dictionary
     • Test a huge dictionary
     • Test an enourmous dictionary
     • Has-map Lookup execution and results
2. 2. Linear Time Complexity
   • Write NSMutableArray+RepeatingValueCountSize category
   • Create Random Array
   • Write SumUp function
     • Test a small random array
     • Test a medium random array
     • Test a huge ramdom array
     • Sum up execution and results
   • Count Odd and Even Function
     • Test Cound and Even Function
     • Count Odd and Even Function execution and results
3. 3. Quadratic Time Complexity
   • Multiplication Table Function
     • Test Multiplication Function
     • Multiplication Table Function execution and results
4. 4. Hints of polinomial Time Complexity
5. 5. Logarithmic Time
6. 6. Summary

3. Recursion

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)
   • sum(n) function
     • Sum(n) function test
     • sum(n) execution and results
   • sumOptimized() function
     • sumOptimized() function test
     • sumOptimized() execution and results
2. 2. Pair Matching Challenge
   • findTwoSum() function
     • findTwoSum() function test
     • findTwoSum() execution and results
   • findTwoSumOptimized() function
     • findTwoSumOptimized() function test
     • findTwoSumOptimized execution and results
3. 3. Find the Equilibrium Index
   • equilibrium() function
     • equilibrium() function test
     • equilibrium() execution and results
   • equilibriumOptimized() function
     • equilibriumOptimized() function test
     • equilibriumOptimized execution and results
4. 4. Summary

5. Generics

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

6. The Build-In Objective-C collection Types

At a glance: Notes

1. 1. NSArray / NSMutableArray
   • Immutable objects
   • Sorting
   • Filtering
2. 2. NSSet/NSMutableSet
3. 3. NSDictionary/NSMutableDictionary
4. 4. C primitive types
5. 5. Collections and nil

7. Basic Sorting

At a glance: Notes

1. 1. Selection Sort
   • Selection Sort Implementation
   • Selection Sort Time Complexity
   • Selection Sort Test
   • Selection Sort execution and results
2. 2. Insertion Sort
   • Insertion Sort Implementation
   • Insertion Sort Time Complexity
   • Insertion Sort Test
   • Insertion Sort execution and results
   • Using shuffled arrays (worse case scenario, the same code)
   • Using sorted arrays (best case scenario)
3. 3. Insertion Sort vs Selection Sort
   • algorithms test
   • Conclusions for I vs S algorithm
4. 4. Bubble Sort
   • Bubble Sort Implementation
   • Bubble Sort Time Complexity
   • Bubble Sort Test
   • Conclusions for Bubble Sort
5. 5. Selection vs Insertion vs Bubble sort algorithms
   • Selection vs Insertion vs Bubble sort algorithms Test
   • Selection vs Insertion vs Bubble sort algorithms execution and results

8. Advance Sorting

At a glance: Notes

1. 1. The merge sort
   • Merge Sort Implementation
   • Merge Sort Test
   • Merge Sort execution and results
2. 2. QuickSort
   • QuickSort Implementation
   • QuickSort test
   • QuickSort execution and results
3. 3. Merge sort vs QuickSort
   • Merge sort vs QuickSort Test
   • Merge sort vs QuickSort execution and results