This project tackles the problem of ordering paintings at an art exhibition, with each painting of a specific height and width. Rows have a fixed width, and their height is determined by the tallest painting in a given row. The goal is to minimize the total height of the rows when stacked vertically upon each other, and various algorithmic paradigms are employed to solve this problem.
Milestone 1 - Report
We designed, implemented, and proved the correctness and time complexity of two
This repository contains coursework for COP4533: Algorithms Abstraction and Design at the University of Florida. It is intended to be viewed and modified solely by its specified collaborators:
- This code is not open-source and is not available for general use, modification, or distribution.
- Viewing this repository does not grant any rights or licenses to use, modify, or share its contents.
- Current University of Florida students are expressly prohibited from using, referencing, or adapting any part of this code for their own coursework.
Any unauthorized access, use, copying, or adaptation of this repository's contents may constitute:
- A violation of the University of Florida Student Honor Code and Student Conduct Code.
- Academic misconduct, which may result in severe penalties.
- Copyright infringement.
Such violations will be reported to the appropriate university authorities.
This repository is made visible for demonstration of coding skills and project experience only. Any use beyond evaluation for employment purposes is not permitted without explicit written consent from the repository owners and the course instructor.
For more information on the UF Honor Code, please refer to the University of Florida Student Honor Code and Student Conduct Code Regulation.
© 2024 Elijah Johnson, Patrick Kallenbach, Nicholas Lindner. All Rights Reserved.