İTÜ BLG 335E - Analysis of Algorithms I Projects
-
Updated
May 14, 2018 - C++
İTÜ BLG 335E - Analysis of Algorithms I Projects
Cython-wrapped C++ red-black interval tree implementation
Implementation of a retail stock keeping system to keep track of inventory.
An enhanced version of GADA, a fast and sparse segmentation algorithm
Implementation of C++ containers from the Standard Template Library (STL) in compliance with C++98 standards. Includes vector, map, stack, and additional features like iterators and SFINAE. Red-black tree set implementation.
Educational implementation of red-black tree for "Algorithms and data structures" at MMCS SFEDU. It's based on "Introduction to Algorithms, CLRS".
algorithms and tests for C/C++, also available at
Implementation of a few STL-containers
Datastructure Implementation
My solution for ft_containers of the Common core of 42 school.
Datastructures using c++
efficient interval tree implemention based on red-black tree, ref by "Introduction to Algorithms".
A drop-in replacement for the the equivalent specialization of __gnu_pbds::tree template.
The project is to implement basic container classes in CPP: vector, stack, map and set (RBTree) I will write ReadMe file later.
Some Interesting Data Structures in C++
Several commonly used data structures are implemented with C++11.
A CLI based Database management system that reduces spaces and time complexity using self made AVL, Red-Black trees.
Add a description, image, and links to the red-black-tree topic page so that developers can more easily learn about it.
To associate your repository with the red-black-tree topic, visit your repo's landing page and select "manage topics."