From the course: Parallel and Concurrent Programming with C++ Part 2
Join today to access over 22,600 courses taught by industry experts or purchase this course individually.
Divide and conquer - C++ Tutorial
From the course: Parallel and Concurrent Programming with C++ Part 2
Divide and conquer
- One class of algorithms that are well-suited for parallel execution across multiple processors are divide and conquer algorithms. They work by first dividing a large problem into a number of smaller subproblems of roughly equal size. Next, the conquer phase recursively solves each of those subproblems. And finally, the solution to the subproblems are combined together to produce the overall solution for the original problem. The common structure for divide and conquer code usually consists of an if/else statement. If the algorithm has reached what's called a base case, meaning the problem has been subdivided into a small enough piece to solve directly, then simply solve it. Otherwise, following the else case, divide the current problem into two smaller pieces referred to as the left and right problems. Solve both of those problems recursively using the same divide and conquer strategy, then combine the left and right…
Practice while you learn with exercise files
Download the files the instructor uses to teach the course. Follow along and learn by watching, listening and practicing.
Download courses and learn on the go
Watch courses on your mobile device without an internet connection. Download courses using your iOS or Android LinkedIn Learning app.