Solution

Quick Sort is a Divide and Conquer algorithm that works by selecting a pivot element and partitioning the array into two subarrays, recursively sorting each subarray. This approach efficiently handles large datasets, making it faster than many other sorting algorithms. b) Bubble Sort repeatedly swaps adjacent elements, without using Divide and Conquer. c) Insertion Sort builds a sorted array incrementally, but does not divide the dataset. d) Selection Sort selects the smallest element in each pass, without recursion or dividing. e) Counting Sort is a non-comparative algorithm, not based on Divide and Conquer.