Back to Portfolio

Overlap Coverage

• Class: Data Structures
• Grade: C
• Language(s): C++
• Source Code Repository: (Please email me to request access.)

Project description

This project finds the minimum overlap of sets that cover all points. For example, if there were multiple group projects that needed to be presented at the end of the semester and the professor must grade everyone at least once, they would want to minimize the number of presentations that they see. They can do this by finding the minimum amount of overlap. Similarly, the project aims to find the minimum amount of overlap within a set of numbers.

How to compile and run the program

cd ./project
g++ main.cpp MinimumOverlap.cpp -o
.\main.cpp small30.set

UI Design

The program parses the dataset and is able to find the minimum overlap with the help of the minOverlap function. This function is a recursive function that optimizes overlap by examining different combinations of sets and always keeping track of the smallest solution.

Fig 1. Timing for a small set

Fig 2. Timing for a medium set

Fig 3. Timing for a large set

For more details see GitHub Flavored Markdown.

Back to Portfolio