News for hackers. Stuff that matters.

A comment on Dynamic Programming vs. Divide-and-Conquer (2018).

Re:Dynamic Programming vs. Divide-and-Conquer (2018) by tracyhenry on Sunday April 25, 2021 @04:03AM (#26931107)
Merge sort seems to be a more classic example for divide-and-conquer which involves merging the results from two subproblems.
[ Parent | on HN ]
Re:Dynamic Programming vs. Divide-and-Conquer (2018) by strikelaserclaw on Monday April 26, 2021 @01:33AM (#26939519)
i personally like quick sort because it leads to understanding other divide and conquer algorithms like finding the kth order statistic.
[ Parent | on HN ]