Skip to content

Latest commit

 

History

History
30 lines (25 loc) · 562 Bytes

File metadata and controls

30 lines (25 loc) · 562 Bytes

Algorithm

정의

  • 문제를 해결하는 풀이과정.
  • 여러 풀이법 중 가장 효율적인 방법.
  • 특정 구조를 갖는 공식화된 알고리즘들이 존재한다.

종류

1. Sort

  1. Bubble
  2. Selection
  3. Insertion
  4. Quick
  5. Merge

2. Search

  1. Binary Search
  2. Sequential Search

3. Graph

  1. BFS(Breadth-First Search)
  2. DFS(Depth-First Search)
  3. Shortest Path Algorithm

4. Problem Solving Strategy

  1. Recursive Call
  2. Dynamic Programming
  3. Divide & Conquer
  4. Greedy
  5. Backtracking