Skip to content
#

conquer

Here are 12 public repositories matching this topic...

Divide and Conquer algorithms solve problems by dividing them into smaller sub-problems and solving each sub-problem independently. The solutions to the sub-problems are then combined to form the solution to the original problem. This technique is widely used in algorithms for sorting, searching, matrix multiplication, and many other areas.

  • Updated Feb 9, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the conquer topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the conquer topic, visit your repo's landing page and select "manage topics."

Learn more