Divide-and-conquer algorithm

Algorithm design paradigm based on multi-branched recursion

Last price

—

Floor price

—

7-day median

—

30-day sales

30-day range

—

In circulation

Price history

Show table

Date	median	Low	High	sales

Sales history

Last sale: —
30-day average: —
30-day low: —
30-day high: —
Sales 7d: 0
Sales 30d: 0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

From Wikipedia

In computer science, divide and conquer, originally a political maxim, designates an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g., the Karatsuba algorithm), finding the closest pair of points, syntactic analysis (e.g., top-down parsers), SAT solving, and computing the discrete Fourier transform (FFT). Designing efficient divide-and-conquer algorithms can be difficult. As in mathematical induction, it is often necessary to generalize the problem to make it amenable to a recursive solution. The correctness of a divide-and-conquer algorithm is usually proved by mathematical induction, and its computational cost is often determined by solving recurrence relations.

Text: Wikipédia, CC BY-SA 4.0. · Image: Bruno schneider emap (CC BY-SA 3.0) ·