Algorithms to solve a subset sum problem using different methods.
- Brute Force
- Branch and Bound
- Divide and Conquer
This project was developed under the Algorithms and Data Structures course of University of Aveiro.
- Clone the repository:
$ git clone https://github.com/leo-dsf/Merkle-Hellman_Cryptosystem- Compile with the following command:
$ cc -Wall -O2 subset_sum_problem.c -o subset_sum_problem- Run:
$ ./subset_sum_problem- Leonardo Flórido - leo-dsf
- Gabriel Hall - GabrielHall02
- Diogo Alves - DiogoAlves002
This project is licensed under the MIT License.