Algorithms

Step 1: Understand Divide and Conquer technique.
The Divide and Conquer technique involves dividing the problem into smaller subproblems, solving each subproblem, and then combining their solutions to solve the original problem.

Step 2: Evaluate each option.
- **Quick Sort:** A sorting algorithm based on Divide and Conquer where the array is partitioned into smaller sub-arrays.

- **Strassen's Matrix Multiplication:** This algorithm uses Divide and Conquer to multiply matrices efficiently.

- **Linear Search:** A search algorithm that scans through the elements linearly and does not use Divide and Conquer.

- **Binary Search:** A Divide and Conquer technique where the search space is halved in each step.

Step 3: Conclusion.
The correct answer is (3) **Linear Search** since it does not use Divide and Conquer.