iOS

13. Disjoint Set (Union/Find)

-

A disjoint set is a data structure that stores and manipulates information…

Mathematics 1

-

4. 1. Permutation

11. String

-

11. 1. Palindrome

3. Trees 1

Express hierarchical structure.

3. 1. Heap

• It should be a complete binary tree.

6. Sorting 2

6. 6. Heap Sort — O(NlogN)

2. List-Based Collections

-

2. 1. Array

6. Sorting

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

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…

1.1 Big-O

It is a method to analyze the resource usage of the algorithm. The resources indicate running time, memory, storage, networking, etc., but…