During this project, we had to implement sorting algorithms (bubble sorting, fast sorting) in order to test them on our problem, and we had to evaluate the complexity of each algorithm. The goal was to analyze the execution time of our programs and see their complexity in order to minimize them as much as possible. The project was realized in C language
Problem :
We have a given quantity S of jam, as well as a system of jar capacities available to us. We suppose that we can take as many jars of available capacities as we want. The goal is then to use a minimal number of jars to store completely our quantity S of jam. A jar must be filled completely.