A complete list of solved exercises and the final project

• Starting
• Features
• Prerequisites
• Built with
• Authors
• License

This repository contains the solved exercises from Data Structure 1 course in the third semester. The exercises have more complex and challenging concepts, as well as the use of classes. They were solved within the VPL because of the college. It is a platform that offers a virtual environment for teaching and practicing programming, allowing users to develop and execute code in various languages directly in the browser.

The final project was a presentation with @ViniciusBeuther of the Heap Sort algorithm using slides as support material and the execution of code that was adapted from Brilliant. It was also necessary to grasp the concepts of Heapify to comprehend the entire functioning of the sorting process. It was fundamental to improve my knowledge in this language and it also helped with my Bachelor's Degree in Information Systems at UDESC.

Used during the evolution of exercises and the final project:

• Natural structures.
• Linked lists, linked queues and linked stacks.
• Balanced trees.
• Algorithms for manipulating structures.

You need to have the Python language on your machine along with an IDE (Integrated Development Environment) or a website that can run the codes. For example:

• IDE PyCharm
• IDE Visual Studio Code
• Website Replit
• Website PythonAnywhere
• Website Codecademy

• Python 3 - The programming language used.

• Mateus Adada - Developer and documentation - mateusadada
• Vinicius E. Beuther - Developer - ViniciusBeuther

You can also see the list of all collaborators who participated in this project.

This project is under the license MIT. See the LICENSE.md file for more details.

Developed with ❤️ in Brazil 🇧🇷