## Algorithms and Data Structures in Swift 4 - Succeed in your Software Developer Job Interview!

#### Karoly Nyisztor, Senior Software Engineer, Instructor

Play Speed
• 0.5x
• 1x (Normal)
• 1.25x
• 1.5x
• 2x
46 Videos (1h 58m)
• Course Overview

3:11
• Introduction

4:15
• Big-O Notation - Overview

2:20
• Constant Time - O(1)

3:56
• Linear Time - O(n)

3:19

3:39
• Hints for O(n^k) Complexity

1:27
• Logarithmic Time - O(log n)

1:56
• Big-O Summary

1:34
• Recursion - Overview

0:40
• What is Recursion?

2:43
• How Does Recursion Work?

4:45
• Recursion Pitfalls

2:37
• How to Avoid Infinite Recursion?

1:51
• The Power of Algorithms

1:29
• Calculate Sum(N)

3:04
• Pair Matching Challenge

4:17
• Find the Equilibrium Index

3:51
• The Power of Algorithms - Summary

1:49
• Working with Generics - Introduction

0:55
• Why Generics?

1:24
• Generic Types

1:56
• Generic Functions

3:47
• Swift Collection Types - Overview

0:55
• The Array

2:08
• Accessing the Array

1:09
• Modifying the Array

2:43
• The Set

2:27
• Accessing and Modifying the Set

1:48
• Set Operations

1:10
• The Hashable Protocol

4:40
• The Dictionary

2:33
• Accessing and Modifying the Dictionary

1:35
• Basic Sorting

2:17
• Selection Sort

5:33
• Selection Sort - Summary

0:49
• Insertion Sort

7:58
• Insertion Sort - Summary

1:03
• Bubble Sort

5:05
• Bubble Sort - Summary

1:01

0:53
• Merge Sort

3:46
• Merge Sort - Summary

0:55
• Quicksort

3:28
• Quicksort - Summary

0:57
• Final Thoughts & Useful Resources

2:32