Divide and Conquer Algorithm 알고리즘이란?직역하자면 나눠서 정복한다.하나의 문제를 두 가지 혹은 그 이상의 작은 문제들로 나눠 해결하여 본래의 문제를 해결하는 방식
D & C Divide and Conquer Algorithm's classic examples
- Merge Sort
- Quick Sort
en.wikipedia.org/wiki/Divide-and-conquer_algorithm
Divide-and-conquer algorithm - Wikipedia
From Wikipedia, the free encyclopedia Jump to navigation Jump to search Algorithms which recursively solve subproblems In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem
en.wikipedia.org
leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer
Explore - LeetCode
LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore.
leetcode.com
'Algorithm > 개념 정리' 카테고리의 다른 글
| 시간 복잡도 (Time Complexity) (0) | 2022.11.07 |
|---|---|
| 복잡도 (0) | 2022.11.07 |
| Unfold Recursion (0) | 2021.04.15 |
| Merge Sort (0) | 2021.04.14 |
| Climbing Stairs를 recursive 아닌 방법으로 풀어보기 (0) | 2021.04.13 |