Journey to Tech Company

9. Greedy Algoritm

-

• How to choose the most reasonable answer in current situation.

7. Searching 2

-

7. 2. Brute-Force

3. Trees 1

Express hierarchical structure.

3. 1. Heap

• It should be a complete binary tree.

1.1. About Swift

Apple has created a new programming language called Swift to use in its product development for iOS, macOS, watchOS, and tvOS. Swift is aiming at safety-first programming patterns and introduces many new features such as optional, generic, protocol, tuple, and extension for easier and more fun…

7. 1. Backtracking

An algorithm that takes into account the number of all cases. This is the appropriate way to represent the state space as a…

6. Sorting

O(N²): Bubble Sort, Selection Sort, Insertion Sort
O(NlogN): Quick Sort, Merge Sort, Heap Sort

6. Sorting 2

6. 6. Heap Sort — O(NlogN)

Preparing the Swift Coding Interview — [Index] Algorithm and Data Structure

1. Big-O and 7-Steps of Thinking…

5. Recursion

A recursion function is a function that calls itself.

Factorial !