mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-28 18:26:54 +00:00
fix(curriculum): add hyphen in sub-problems (#65260)
This commit is contained in:
committed by
GitHub
parent
20d3983560
commit
085b319187
+1
-1
@@ -7,7 +7,7 @@ dashedName: what-is-divide-and-conquer-and-how-does-merge-sort-work
|
||||
|
||||
# --description--
|
||||
|
||||
The divide and conquer paradigm in computer science is a technique for recursively breaking down problems into smaller sub problems. One of the key aspects of this technique is recursion, which happens when a function calls itself repeatedly until a base case is reached. In this lesson, we will take a look at the merge sort algorithm to better understand how the divide and conquer technique works.
|
||||
The divide and conquer paradigm in computer science is a technique for recursively breaking down problems into smaller sub-problems. One of the key aspects of this technique is recursion, which happens when a function calls itself repeatedly until a base case is reached. In this lesson, we will take a look at the merge sort algorithm to better understand how the divide and conquer technique works.
|
||||
|
||||
Let's say we had this list of numbers:
|
||||
|
||||
|
||||
Reference in New Issue
Block a user