Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Divide and Conquer Algorithm: Computer science, Algorithm design, Paradigm, Recursion, Algorithm, Sorting algorithm, Quicksort, Multiplication algorithm, Syntactic analysis, Discrete Fourier transform -

inglise keel
2026-03-19
233,16 € 310,88 €

-25% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking 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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking 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. This technique is the basis of efficient algorithms for all kinds of problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g. Karatsuba), syntactic analysis (e.g., top-down parsers), and computing the discrete Fourier transform (FFTs). On the other hand, the ability to understand and design D&C algorithms is a skill that takes time to master. As when proving a theorem by induction, it is often necessary to replace the original problem by a more general or complicated problem in order to get the recursion going, and there is no systematic method for finding the proper generalization.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786130755195
Kirjuta oma arvustus
Te vaatate: Divide and Conquer Algorithm: Computer science, Algorithm design, Paradigm, Recursion, Algorithm, Sorting algorithm, Quicksort, Multiplication algorithm, Syntactic analysis, Discrete Fourier transform
Teie hinnang:

Goodreads'i arvustused

233,16 € 310,88 €