TAAFT
Free mode
100% free
Freemium
Free Trial
Deals
Companies
BaseMax
Repositories1,029
SubSetSumBacktracking

BaseMax / SubSetSumBacktracking

This is an implementation of the Sub Set Sum Backtracking algorithm in C. The algorithm is used to find a subset of a given set of numbers that adds up to a given sum. The algorithm is implemented using backtracking.

0 0 Language: C License: GPL-3.0 Updated: 3y ago
algorithm backtracking backtracking-algorithm backtracking-search c data-structures-and-algorithms datastructure ds sub-set-sum subsetsum sum sum-algorithm tree

README

Sub Set Sum Backtracking

This is an implementation of the Sub Set Sum Backtracking algorithm in C. The algorithm is used to find a subset of a given set of numbers that adds up to a given sum. The algorithm is implemented using backtracking.

Usage

To compile the program, run the following command:

gcc -o subsetsum subsetsum.c

To run the program, run the following command:

./subsetsum

Example

Enter the number of elements: 5
Enter the elements: 1 2 3 4 5
Enter the sum: 10
The subset is: 1 2 3 4

The program will print the subset of numbers that add up to the given sum.

License

This project is licensed under the GPL-3 License - see the LICENSE file for details

© Copyright (c) 2022 Max Base

0 AIs selected
Clear selection
#
Name
Task