Home of LoycCore, the LES language of Loyc trees, the Enhanced C# parser, the LeMP macro preprocessor, and the LLLPG parser generator.

Storing and managing call detail records (CDRs)

This project serves to display an ordered and balanced heap binary trees in the stdout.

Data Structures and Algorithms in C++

This is the implementation of A* and Best First Search Algorithms in python language. The project comprimise two data structures: stack and heap.

Codes for various data structure in C, C++ and JAVA

min Heap Tree Class

Implementation of trees and heaps in julia

Our project for Data Structures Course taken during fall 2023 semester

Prend une liste de mots ou un texte en entrée pour construire un arbre/tas optimisé.

Here you can find some of mine projects from the bachelor's course of Algorithms and Data Structures, having Luca Tesei as professor at the University of Camerino (UNICAM)

Python functions for working with d-ary Heap (Heap with more than 2 child nodes) For more info (https://en.wikipedia.org/wiki/D-ary_heap)

Creates a heap of ten random numbers and sorts it. Methods: display(), sort(), swap(), heapdown()

A repository for problem solving in java

Enhancing Heap-Tree Efficiency for Modern Computing

The project implements a futuristic automated emergency room (ER) triage system. The system receives data in the form of patient and injury pairs over time and automatically assign patients to doctors as the resources become available depending on the severity of the patient’s injury.

Implementação de estruturas de dados em árvores

Contains popular Sorting Algorithm Exercises

Binary heap in Python

Individual project for Algorithms and Principles of Computer Science course AA 2020/2021