Repository consists of solution for data structures and algorithms focusing on technical problems.

Course assignments from csc 225 at UVIC.

Implementations of some common data structures and algorithms. These are based on the assignments that are offered in CSE204 course by BUET.

Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.

Contains popular Sorting Algorithm Exercises

Heap allocator: final assignment for CS 107: Computer Organizations and Systems, taken Spring 2018.

Generates all permutations of n objects with the heap algorithm.

Program for searching cheapest path in graph

Leonardo heap is the implicit data structure that uses only O(1) auxiliary data to implement smoothsort, an in-place algorithm offering average performance of O(n⋅log(n)) and O(n) in the best-case.

Creating full and partial sets of permutations in Java using Heap's algorithm

🔄 Implementation of Heap Sort 🔄

Simulator of a hotel wake up alarm system.

Application for finding optimal travel path (Dijkstra + Heap)

Projeto de Algortimos do curso de Sistemas de Informação UFPE

problems practice

Collection of Assignments and Programs For CS 146: Data Structures and Algorithms

My own implementation of malloc and free

Repositório dos roteiros da disciplina de Laboratório de Estrutura de Dados

This is a choice based card game revolving around a typical college student. This game was inspired by the 20 questions & Reigns card game. (WCC)