Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Divide and Conquer Algorithm
CHF 52.90
Auf Lager
SKU
2QHMJER8U2K
1 Verfügbar 
Geliefert zwischen Fr., 27.02.2026 und Mo., 02.03.2026
Details
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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130755195
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- EAN 9786130755195
- Format Fachbuch
- Titel Divide and Conquer Algorithm
- Herausgeber Alphascript Publishing
- Anzahl Seiten 180
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
