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 project serves to display an ordered and balanced heap binary trees in the stdout.

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

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.

Enhancing Heap-Tree Efficiency for Modern Computing

Implementation of trees and heaps in julia

Our project for Data Structures Course taken during fall 2023 semester

min Heap Tree Class

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)

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

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

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

Contains popular Sorting Algorithm Exercises

Binary heap in Python

min and max heap implementation in c++ using templates

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

Implementation DS in JAVA

This repo. includes my notes for C++ programming language including OOP, Data structures and algorithms.

🔄 Implementation of Heap Sort 🔄

A step-by-step implementation of a heap-tree in Python. By this class you can easily convert an array to maxheap or minheap tree. Also you can extract the maximum or minimum value from the heap-tree. The heap-tree is a binary tree that can be used to sort an array of numbers. (both MaxHeap and MinHeap)

All necessary codes for Data Structures and Algorithms that I learned in the namesake course.

Used pure C++, OOP, and no pre-defined data structures, created a database capable of storing bank account data and handling different types of queries at O(logN) and creating log files online.

Minimum Binary Heap implementation

Estructuras de Datos 2019 - Licenciatura en Sistemas de Información

Journey Through the Kingdom of Aspire C++ simulation of a fantasy inventory system using Fibonacci max/min heaps to manage gems. Implements player commands (D[x], M[x], R[k], etc.) for trading, theft, and scripted gameplay, fulfilling the Algorithms and Data Structures 2 coursework on Using Heaps in a Computer Game

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 new output file.