What are some examples of divide and conquer algorithms?

Some examples of divide and conquer algorithms are: Merge Sort, Quick Sort, Strassenâ€™s Algorithm.

These algorithms divides the array into two halves recursively and then work on those separated halves to solve the final problem.