Algorithm Lab course for Software Engineering, SUST

Repositorio para los laboratorios de Algoritmos Avanzados. 2018-2.

This is an implementation of the 0-1 knapsack problem in C using a recursive approach. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

Algorithms and data structures(lists, trees, etc)

This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.

Simple project in C to practice using arrays and loops as an assignment in Systems Programming A @ Ariel University

A simple program that computes the Knapsack problem using branch-and-bound (fractional method).

A C implementation of algorithms solving the Knapsack problem with different levels of efficiency.

Generation of solutions from binary numbers in the C language, which can be used for various purposes.

This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.