Posts

Last updated on Feb 24, 2022
Data Structures and Algorithms 4-2. Hash-Table (1/2)

Hash function: Map arbitrary type data to array subscripts. (High dimension to low dimension)

Last updated on Feb 19, 2022
High-concurrency server (Basic - C10k)

Epoll_server <—–>Client

Last updated on Feb 18, 2022
Data Structures and Algorithms 4-1. Binary-Search (1/1)

Leetcode- 69, 35, 1, 34, 1658, 475, 81, 4

Last updated on Feb 12, 2022
Data Structures and Algorithms 3-2. Merge-Sort (1/1)

Implementation, Leetcode- offer - 51, 23, 148, 1305, 327, 315, 53, 1508, 04.08, 1302

Last updated on Feb 8, 2022
Data Structures and Algorithms 3-1. Quick-Sort (2/2)

Leetcode- offer - 21, 148, 75, 95, 394, 11, 239, 470

Last updated on Feb 8, 2022
Data Structures and Algorithms 3-1. Quick-Sort (1/2)

Quick-Sort + InsertSort – Threshold + getmid

Last updated on Feb 8, 2022
Data Structures and Algorithms 2-3. Union-find (2/2)

Leetcode- 547, 200, 990, 684, 1319, 128, 947, 1202

Last updated on Feb 8, 2022
Data Structures and Algorithms 2-3. Union-find (1/2)

Weighted_Quick-Union with Path Compression

Last updated on Feb 8, 2022
Data Structures and Algorithms 2-2. Heap (2/2)

Leetcode- offer - 40, 1046, 703, 215, 373, 692, 295, 264, 313, 1753, 1801

Last updated on Feb 8, 2022
Data Structures and Algorithms 2-2. Heap (1/2)

Heap is a complete binary tree

Heap is an implementation of a priority queue.