3 dépôts
Documentation detailing the time and space complexity of standard library methods and common data structures.
Explore 3 awesome GitHub repositories matching education & learning resources · Algorithm Complexity References. Refine with filters or upvote what's useful.
This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed primarily as an educational resource for computer science study and technical interview preparation. It provides modular implementations of fundamental programming concepts, allowing developers to explore algorithmic logic and data organization through self-contained, verifiable code examples. The library distinguishes itself by pairing every implementation with formal Big O notation, providing predictable insights into time and space scaling requirements. Each algorithm is stru
Provides formal time and space complexity annotations for all implemented algorithms to aid in performance analysis.
This project is a comprehensive educational repository designed to help developers master the core mechanics, runtime behaviors, and browser-native capabilities of the JavaScript language. It provides a structured knowledge base that covers fundamental language features, such as prototype-based inheritance and event-loop-based concurrency, alongside advanced topics like JIT-compiled execution and memory management. The repository distinguishes itself by offering deep-dive technical guides that bridge the gap between abstract language concepts and practical browser implementation. It features
Evaluates the time and space complexity of standard methods to inform performance-conscious architectural decisions.
Ce projet est une collection de référence pour les fondamentaux de l'informatique, fournissant un guide d'étude et des fiches mémo pour les algorithmes et les structures de données. Il sert de ressource pour la préparation aux entretiens techniques, combinant connaissances théoriques et modèles d'implémentation pratiques pour les défis de code. Le contenu inclut un guide comparatif pour analyser l'efficacité et les caractéristiques des tableaux, listes chaînées, tables de hachage et arbres de recherche binaires. Il fournit des résumés de concepts académiques incluant la complexité temporelle et spatiale, les méthodes de tri et les stratégies de recherche. Les matériaux couvrent les modèles algorithmiques, les implémentations de recherche et de tri, et la notation asymptotique. L'information est organisée via une base de connaissances basée sur Markdown avec un mapping hiérarchique des sujets.
Includes a reference index detailing the time and space complexity of common data structures and algorithmic patterns.