This Lab Programs provide hands-on experience in implementing and analyzing fundamental algorithms used in computer science. This lab focuses on practical understanding of algorithm design techniques such as divide and conquer, greedy methods, dynamic programming, backtracking, and graph algorithms.

Analysis of Algorithms using C language

A simple word sorting algorithm with different Binary Search Trees and time complexities in C programming language

Assignments on Analysis and Design of Algorithm

Sorting algorithms & Big O - This project is the implementation of how to select the best sorting algorithm and how to select the best algorithm for a project.

Sorting Algorithms with C

Implementing a priority queue with a maxheap and then with a treap and comparing the results.

Projeto pra análise prática da complexidade de tempo de algoritmos de ordenação (Projeto de faculdade da disciplina de Projeto e Análise de Algoritmos)

This project is a comprehensive collection of sorting algorithms, implemented in C, designed to illustrate various methods of organizing data in ascending or descending order. It includes classic, practical algorithms used in real-world applications, as well as less conventional and novelty algorithms that showcase unique or inefficient approaches.

Trabalho prático 1: Estruturas de Dados (DCC205)

Big O Runtime Complexity program in C. Tests 7 algorithms, then plots their runtime and calculates their time complexity. Summary in pdf.