Tags

algorithm paradigm binary search binary search tree bipartite matching brute force search complete search disjoint set divide and conquer dynamic programming exhaustive search graph graph search greedy kruskal algorithm minimum spanning tree network flow prim algorithm search segment tree shortest path sqrt root decomposition treap tree

---

Algorithm paradigm [4]

• 완전탐색(Complete Search) - 17 July 2017
• 분할 정복(Divide and Conquer) - 11 August 2017
• 탐욕법(Greedy Method) - 12 August 2017
• 동적 계획법(Dynamic Programming) - 13 August 2017

Complete search [1]

• 완전탐색(Complete Search) - 17 July 2017

Brute force search [1]

• 완전탐색(Complete Search) - 17 July 2017

Exhaustive search [1]

• 완전탐색(Complete Search) - 17 July 2017

Divide and conquer [1]

• 분할 정복(Divide and Conquer) - 11 August 2017

Greedy [1]

• 탐욕법(Greedy Method) - 12 August 2017

Dynamic programming [1]

• 동적 계획법(Dynamic Programming) - 13 August 2017

Graph [4]

• 그래프 탐색(Graph Search) - 15 August 2017
• 최단 경로(Shortest Path) - 16 August 2017
• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017
• 네트워크 유량(Network Flow) - 22 August 2017

Graph search [1]

• 그래프 탐색(Graph Search) - 15 August 2017

Shortest path [1]

• 최단 경로(Shortest Path) - 16 August 2017

Minimum spanning tree [1]

• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017

Tree [3]

• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017
• 구간 트리(Segment Tree) - 23 August 2017
• 이진검색트리(Binary Search Tree) - 12 September 2017

Kruskal algorithm [1]

• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017

Prim algorithm [1]

• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017

Disjoint set [1]

• 최소 스패닝 트리(Minimum Spanning Tree) - 17 August 2017

Network flow [1]

• 네트워크 유량(Network Flow) - 22 August 2017

Bipartite matching [1]

• 네트워크 유량(Network Flow) - 22 August 2017

Segment tree [1]

• 구간 트리(Segment Tree) - 23 August 2017

Sqrt root decomposition [1]

• 평방 분할 기법(Square Root Decomposition) - 11 September 2017

Search [2]

• 이진검색트리(Binary Search Tree) - 12 September 2017
• 이진 탐색(Binary Search) - 12 September 2017

Binary search tree [2]

• 이진검색트리(Binary Search Tree) - 12 September 2017
• 트립(Treap) - 28 January 2021

Binary search [1]

• 이진 탐색(Binary Search) - 12 September 2017

Treap [1]

• 트립(Treap) - 28 January 2021