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)

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

Our project for Data Structures Course taken during fall 2023 semester

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

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)

Implementation of trees and heaps in julia

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.

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

Enhancing Heap-Tree Efficiency for Modern Computing

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

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)

A repository for problem solving in java

Binary heap in Python

Contains popular Sorting Algorithm Exercises

Based on a set of temperatures, this program calculates the median temperature for every new temperature value. Implemented with PriorityQueues. One mode of program is interactive: provides user with command prompt to enter numeric values, then produces median for every new input. File mode reads values from file, then produces medians onto a ne…

Java Implementation of the Huffman coding, which is used to compress files.