This project is an algorithm implementation reference and educational resource providing a library of common computer science algorithms implemented in Rust. It serves as a codebase for learning data structures and algorithmic logic through practical, executable examples. The collection is designed for computer science education and rust language proficiency, allowing users to study computational patterns and solve programming challenges. It provides a reference for those practicing competitive programming or seeking to understand how to apply Rust idioms to standard algorithmic logic.
cp-notebook is an algorithmic knowledge base and implementation library designed for competitive programming practice. It serves as a system for computational problem solving, allowing for the organization of problem sets, solution templates, and the study of competition mathematics. The project utilizes a taxonomy-based tagging system and schema-driven organization to map computational tasks to a consistent file structure. It employs a language-agnostic template engine and markdown-based rendering to transform raw text and code snippets into a formatted, static knowledge base for fast lookup
This is a collection of classic computer science algorithms and data structures implemented from scratch in JavaScript. The project provides reference implementations of fundamental concepts including sorting algorithms, binary search, linked lists, and binary search trees, all built as standalone pure functions with no external dependencies. The implementations cover a range of data structures, including singly-linked, doubly-linked, and circular linked lists with full traversal and mutation operations, as well as binary search trees supporting insertion, deletion, and search. Sorting algori
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
Pygorithm is a Python algorithm library and computational logic reference. It provides a collection of standard algorithmic implementations and tools for analyzing the runtime efficiency and scaling performance of specific functions.
The main features of omkarpathak/pygorithm are: Computational Logic References, Time and Space Analyzers, Algorithm Libraries, Algorithm Implementations, Complexity Analysis, Algorithm Logic References, Computer Science Education, Source Code Exposure.
Open-source alternatives to omkarpathak/pygorithm include: thealgorithms/rust — This project is an algorithm implementation reference and educational resource providing a library of common computer… bqi343/cp-notebook — cp-notebook is an algorithmic knowledge base and implementation library designed for competitive programming practice.… humanwhocodes/computer-science-in-javascript — This is a collection of classic computer science algorithms and data structures implemented from scratch in… kodecocodes/swift-algorithm-club — This project is a comprehensive collection of common computer science algorithms and data structures implemented in… thealgorithms/go — This repository serves as a comprehensive collection of standard computer science algorithms and data structures… jack-lee-hiter/algorithmsbypython — AlgorithmsByPython is a reference library and educational repository providing runnable Python implementations of…