Skip to content

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.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/divide-and-conquer-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Divide and Conquer Algorithms Android App

An open-source Android application that implements various divide and conquer algorithms in Kotlin.

Features

  • User-friendly interface for inputting problem information
  • Implements algorithms for various problems such as sorting, searching, and matrix multiplication
  • Option to compare the performance of the divide and conquer algorithm with other algorithms
  • Can be used by students, computer scientists, and mathematicians alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/DivideAndConquerAlgorithms.git
  2. Open the project in Android Studio
  3. Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.

About

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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages