0 views collected around this technical thread.
This article explains the Fork/Join model and Java's ForkJoinPool, covering divide‑and‑conquer theory, task splitting, core APIs, code examples, common pitfalls, performance testing, and best‑practice recommendations for high‑concurrency computing.
This article explains the limitations of ThreadPoolExecutor, introduces the Fork/Join model and its divide‑and‑conquer algorithm, demonstrates custom RecursiveTask implementations with full source code, analyzes ForkJoinPool construction, task submission, work‑stealing, monitoring APIs, commonPool pitfalls, and performance evaluation, providing practical guidance for Java developers.
This paper identifies the trade‑off between simple and hard negatives in embedding‑based retrieval for recommendation, proposes a clustering‑based divide‑and‑conquer framework combined with prompt‑driven multi‑task learning to improve relevance, diversity, and fairness, and validates the approach through offline metrics, online A/B tests, and comparative experiments.
This article explains the classic maximum subarray problem, presents a brute‑force O(n³) method, an improved O(n²) version, a divide‑and‑conquer O(N log N) algorithm, and a linear‑time O(N) dynamic‑programming solution, each with full C++ code and complexity analysis.
This article explains the merge sort algorithm’s divide‑and‑conquer principle, analyzes its O(n log n) time complexity, and provides two complete C# code examples—one for a generic merge sort and another for merging two already sorted arrays—along with visual illustrations of the merging process.
This article introduces recursion, explains its core principles, presents a general problem‑solving approach, and walks through multiple practical examples—from factorial and climbing stairs to binary tree inversion and the Tower of Hanoi—while analyzing time and space complexities and offering optimization techniques.
The article describes how a Ctrip senior Android engineer uses divide‑and‑conquer, MVP with Clean Architecture, and Jetpack components such as LiveData and ViewModel to break down a highly coupled payment module into reusable view components, improve data flow, and simplify testing and maintenance.
This article explains the Delaunay triangulation concept, its geometric properties such as empty circumcircles and maximal minimum angles, and presents a detailed divide‑and‑conquer algorithm with step‑by‑step merging logic and a complete TypeScript code implementation.
This article explains the quick sort algorithm, covering its basic divide‑and‑conquer principle, a naïve C implementation, improvements such as two‑way partitioning, random and median‑of‑three pivot selection, and a non‑recursive version using an explicit stack, with full source code examples.
This article explains the divide‑and‑conquer principle behind quick sort, walks through a concise Python version and a more classic C‑style implementation, analyzes their inefficiencies, and offers practical optimization tips such as better pivot selection, space reduction, and hybrid sorting strategies.
This article explains how abstraction, layered thinking, divide‑and‑conquer, and evolutionary design serve as the four fundamental mental tools that architects use to manage complexity in software systems, illustrated with everyday analogies, diagrams, and practical interview examples.
This article explains the divide-and-conquer algorithmic technique, covering its basic concepts, design strategy, three-step recursive process, complexity analysis, and a list of classic problems that can be efficiently solved using this method.