REPOSITORY OVERVIEWLive repository statistics
★ 0Stars
⑂ 0Forks
◯ 0Open issues
◉ 0Watchers
27/100
OPENREPOHUB HEALTH SIGNALLimited signals
A transparent discovery signal based on current public GitHub metadata.
Recent activity35% weight
10 Community adoption25% weight
0 Maintenance state20% weight
100 License clarity10% weight
0 Project information10% weight
35 This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
README preview
README preview is not available for this repository.
ALGORITHMICALLY RELATEDSimilar Open-Source Projects
Selected from shared topics, language and repository description—not editorial ratings.
A quick collection of C++ utilities that I find useful, partially implemented as a learning exercise and done in the knowledge that such features are already fully implemented in 3rd party libraries (and possibly, although hopefully rarely, the standard STL - oops!). Decision to use header files only is one of convenience, allowing you to simply include what you need and go. Slightly increases compile times due to templates, and reduces readability a fraction... but, it saves time in hobbyist projects!
27/100 healthActive repository
C++No license
⑂ 0 forks◯ 0 issuesUpdated Jan 30, 2018
A Red-Black Tree is a self balancing Binary Search Tree. It is useful in the Linux kernel design. For example in a process scheduler or for keeping track of the virtual memory segments for a process, it's used. It is also used in map, multimap, multiset from C++ STL and java.util.TreeMap , java.util.TreeSet from Java. Besides it's used in K-mean clustering algorithm for reducing time complexity. What’s more MySQL uses Red-Black Trees for indexes on tables. In this project, basic operations with Red-Black Tree like insertion, deletion, searching etc. are performed.
27/100 healthActive repository
CNo license
⑂ 0 forks◯ 0 issuesUpdated Feb 13, 2021