Skip to content
#

conquer

Here are 16 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

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