awesome-repositories.com
Blog
MCP
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetServeur MCPÀ proposNotre méthodologiePresse
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

111 dépôts

Awesome GitHub RepositoriesAlgorithms

Step-by-step procedures and logic structures used to solve computational problems and process data efficiently.

Explore 111 awesome GitHub repositories matching scientific & mathematical computing · Algorithms. Refine with filters or upvote what's useful.

Awesome Algorithms GitHub Repositories

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • donnemartin/system-design-primerAvatar de donnemartin

    donnemartin/system-design-primer

    353,387Voir sur GitHub↗

    Ce projet est une ressource éducative et un guide d'étude complet axé sur l'architecture des systèmes distribués et la conception d'infrastructures backend. Il fournit un programme structuré pour maîtriser les principes de scalabilité, de fiabilité et de performance requis pour concevoir des systèmes logiciels complexes. Le dépôt se distingue en offrant une approche méthodique de la préparation aux entretiens techniques, intégrant des modèles de conception, des compromis architecturaux et des outils de répétition espacée pour aider les utilisateurs à retenir des concepts complexes. Il met l'accent sur l'analyse axée sur les contraintes, enseignant aux utilisateurs comment évaluer des exigences concurrentes comme la latence, la cohérence et la disponibilité lors de l'élaboration de conceptions architecturales. Le contenu couvre un large spectre de capacités de conception de systèmes, notamment des stratégies pour la mise à l'échelle des bases de données, la gestion du trafic et l'optimisation de l'infrastructure. Il détaille des techniques pour la mise à l'échelle horizontale, la mise en cache multicouche, la communication asynchrone et la découverte de services, tout en fournissant des cadres pour effectuer des estimations de ressources et la planification de la capacité. La documentation est organisée comme un guide d'étude, offrant un chemin systématique à travers les fondamentaux de l'ingénierie backend et de la conception de systèmes à grande échelle.

    Explains algorithms used to calculate the most efficient path between nodes in a graph.

    Pythondesigndesign-patternsdesign-system
    Voir sur GitHub↗353,387
  • facebook/reactAvatar de facebook

    facebook/react

    245,669Voir sur GitHub↗

    React est une bibliothèque JavaScript pour créer des interfaces utilisateur basées sur une architecture orientée composants et un flux de données unidirectionnel.

    Copies arrays before applying sorting or reversal to avoid direct state modification.

    JavaScriptjavascriptuifrontend
    Voir sur GitHub↗245,669
  • thealgorithms/pythonAvatar de TheAlgorithms

    TheAlgorithms/Python

    221,992Voir sur GitHub↗

    Ce projet est un dépôt complet d'implémentations computationnelles vérifiées conçu pour servir de ressource éducative pour l'informatique et la résolution de problèmes algorithmiques. Il fournit une collection structurée d'exemples de code qui couvrent les structures de données fondamentales, les opérations mathématiques et les concepts de programmation de base, permettant aux utilisateurs d'étudier la logique et la complexité derrière diverses méthodes computationnelles. Le dépôt se distingue par un modèle d'implémentation modulaire basé sur des références qui organise le code dans des espaces de noms logiques. Cette approche facilite l'exécution indépendante et la clarté éducative, permettant aux utilisateurs d'explorer l'évolution des stratégies computationnelles, des approches naïves par force brute aux solutions optimisées haute performance. En découplant les abstractions de structures de données des opérations algorithmiques, le projet garantit que les implémentations restent interchangeables et faciles à analyser. La surface de capacités couvre un large éventail de domaines techniques, notamment l'apprentissage automatique, la cryptographie, le calcul scientifique et la vision par ordinateur. Il inclut des implémentations pour la modélisation prédictive, les réseaux de neurones et l'analyse statistique, aux côtés d'outils pour le traitement du signal numérique, la gestion des flux réseau et la modélisation financière. La collection répond également à des besoins mathématiques spécialisés, tels que l'algèbre linéaire, les calculs géométriques et la manipulation de bits, fournissant une base large pour la recherche et les applications d'ingénierie.

    Navigate through potential solution paths by systematically reverting decisions when constraints are violated.

    Pythonalgorithmalgorithm-competitionsalgorithms-implemented
    Voir sur GitHub↗221,992
  • trekhleb/javascript-algorithmsAvatar de trekhleb

    trekhleb/javascript-algorithms

    196,089Voir sur GitHub↗

    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 implementations for solving complex combinatorial optimization problems like pathfinding and resource allocation.

    JavaScriptalgorithmalgorithmscomputer-science
    Voir sur GitHub↗196,089
  • labuladong/fucking-algorithmAvatar de labuladong

    labuladong/fucking-algorithm

    134,160Voir sur GitHub↗

    This project is a comprehensive educational platform designed to facilitate the mastery of computer science algorithms and data structures. It provides a structured learning curriculum, a library of practice problems, and an integrated toolkit that supports both academic study and competitive programming preparation. By combining theoretical roadmaps with practical implementation exercises, the system enables users to build a deep understanding of core computational concepts. The platform distinguishes itself through its focus on integrated learning and visual clarity. It offers AI-powered gu

    Supplies standardized input-output templates and efficient data structure implementations to streamline algorithmic problem solving under strict constraints.

    Markdownalgorithmscomputer-sciencedata-structures
    Voir sur GitHub↗134,160
  • fffaraz/awesome-cppAvatar de fffaraz

    fffaraz/awesome-cpp

    71,817Voir sur GitHub↗

    This project is a comprehensive, curated directory of high-quality libraries, tools, and educational resources for C and C++ development. It serves as an ecosystem discovery index, helping developers navigate the vast landscape of third-party components, frameworks, and technical documentation available for the language. The collection is distinguished by its focus on high-performance systems programming and technical mastery. It provides deep coverage of specialized domains including SIMD-accelerated data processing, compile-time template metaprogramming, and asynchronous event-driven archit

    Gathers optimized sorting algorithms and procedures for efficient data organization.

    awesomeawesome-listc
    Voir sur GitHub↗71,817
  • kdn251/interviewsAvatar de kdn251

    kdn251/interviews

    64,941Voir sur GitHub↗

    This project serves as a centralized knowledge base and study guide for mastering computer science fundamentals and technical interview preparation. It provides a structured collection of algorithmic implementations, data structure guides, and theoretical references designed to support professional development and problem-solving skills. The repository distinguishes itself through a taxonomy-based organization that maps complex concepts into a hierarchical structure. It standardizes the expression of abstract data structures and algorithms using a consistent programming language, with impleme

    Illustrates greedy design principles and their application to various optimization-based problem sets.

    Javaalgorithmalgorithm-challengesalgorithm-competitions
    Voir sur GitHub↗64,941
  • azl397985856/leetcodeAvatar de azl397985856

    azl397985856/leetcode

    55,758Voir sur GitHub↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    Provides detailed time and space complexity analysis to evaluate the performance trade-offs of different algorithmic approaches.

    JavaScriptalgoalgorithmalgorithms
    Voir sur GitHub↗55,758
  • google-research/google-researchAvatar de google-research

    google-research/google-research

    38,139Voir sur GitHub↗

    This repository serves as a comprehensive research platform and toolkit for advancing machine learning, quantum computing, and large-scale scientific data analysis. It provides foundational frameworks for developing complex algorithmic systems, offering the necessary infrastructure for distributed training, computational graph execution, and high-performance model development. The project distinguishes itself by integrating specialized research domains with robust, privacy-preserving methodologies. It supports diverse scientific discovery through tools for quantum simulation, physics-informed

    Applies specialized algorithms to address complex combinatorial challenges in research and industrial applications.

    Jupyter Notebookaimachine-learningresearch
    Voir sur GitHub↗38,139
  • fxsjy/jiebaAvatar de fxsjy

    fxsjy/jieba

    35,027Voir sur GitHub↗

    This project is a Chinese text segmentation library and tokenizer designed to split Chinese sentences into individual words. It serves as a natural language processing tool for splitting characters into words, tagging parts of speech, and extracting keywords using statistical analysis. The library distinguishes itself through support for custom dictionary configuration and vocabulary file management, allowing users to override default segmentation rules for domain-specific accuracy. It also includes a TF-IDF keyword extractor to identify significant words and core topics within documents. Th

    Implements a Viterbi-like shortest path algorithm on a word graph to optimize segmentation accuracy.

    Python
    Voir sur GitHub↗35,027
  • thealgorithms/c-plus-plusAvatar de TheAlgorithms

    TheAlgorithms/C-Plus-Plus

    34,361Voir sur GitHub↗

    This project is an educational repository and collection of algorithms implemented in C++. It provides a structured set of code examples covering mathematics, computer science, and physics for reference and learning. The collection includes implementations of data structures for managing hierarchical and linear data, such as binary search trees and AVL trees. It also features simulations of computer science concepts, including CPU scheduling and the resolution of combinatorial puzzles. The repository further covers cryptographic examples through the implementation of classic encryption and e

    Implements solutions for classic combinatorial and algorithmic puzzles like N-Queens and Sudoku.

    C++algorithmalgorithm-competitionsalgorithms-implemented
    Voir sur GitHub↗34,361
  • raywenderlich/swift-algorithm-clubAvatar de raywenderlich

    raywenderlich/swift-algorithm-club

    29,101Voir sur GitHub↗

    This project is a computer science educational resource and a library of common data structures and algorithms implemented in Swift. It serves as a practical reference for studying complexity and efficiency through solved algorithmic problems and conceptual guides. The collection includes implementations of linear and hierarchical data structures, such as stacks, queues, linked lists, and trees. It covers a wide range of computational patterns, including graph and pathfinding implementations, mathematical numerical methods, and data compression techniques. The project also provides implement

    Employs divide-and-conquer strategies to locate elements in sorted collections with logarithmic search time.

    Swift
    Voir sur GitHub↗29,101
  • kodecocodes/swift-algorithm-clubAvatar de kodecocodes

    kodecocodes/swift-algorithm-club

    29,099Voir sur GitHub↗

    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

    Implements algorithms that make locally optimal choices at each step to find global optima.

    Swiftalgorithmsdata-structuresswift
    Voir sur GitHub↗29,099
  • oi-wiki/oi-wikiAvatar de OI-wiki

    OI-wiki/OI-wiki

    26,176Voir sur GitHub↗

    This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

    Automates the competitive programming workflow including testing, verification, and judge platform interaction.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    Voir sur GitHub↗26,176
  • valyala/fasthttpAvatar de valyala

    valyala/fasthttp

    23,264Voir sur GitHub↗

    Fasthttp is a high-performance networking framework for Go, designed to maximize throughput and minimize memory overhead in demanding web applications. It functions as a specialized HTTP server and client library that prioritizes efficient resource management, allowing developers to build scalable services capable of handling massive concurrent traffic with minimal garbage collection pressure. The library distinguishes itself through a focus on zero-allocation processing and low-level optimization. It achieves this by recycling temporary request and response objects through managed pools and

    Converts raw URL strings into structured objects for programmatic access to components.

    Go
    Voir sur GitHub↗23,264
  • wangzheng0822/algoAvatar de wangzheng0822

    wangzheng0822/algo

    23,159Voir sur GitHub↗

    This project is a data structures and algorithms library providing a collection of fifty standard code implementations for managing data and solving common computational problems. It serves as an algorithm implementation reference and study resource for educational use. The codebase covers graph theory implementations for modeling networks and performing searches, as well as string pattern matching libraries for the retrieval of character sequences. It includes a collection of hierarchical data structures, such as binary search trees and priority heaps, and provides optimized solutions for dy

    Implements algorithms to calculate the most efficient path between nodes in a graph.

    Python
    Voir sur GitHub↗23,159
  • qax-os/excelizeAvatar de qax-os

    qax-os/excelize

    20,682Voir sur GitHub↗

    Excelize is a library for reading and writing spreadsheet files in the Office Open XML format. It provides a comprehensive suite of tools for programmatically creating, modifying, and analyzing workbooks, worksheets, and cell data, ensuring compatibility across various office software suites through structured XML serialization. The library distinguishes itself with a built-in formula calculation engine that evaluates complex mathematical and logical expressions directly against workbook data. It also features a memory-mapped streaming architecture, which allows for the efficient processing o

    Sorts numerical arrays by repeatedly comparing adjacent elements and swapping them if they are in the wrong sequence.

    Goagentaianalytics
    Voir sur GitHub↗20,682
  • karpathy/nn-zero-to-heroAvatar de karpathy

    karpathy/nn-zero-to-hero

    20,351Voir sur GitHub↗

    This project is an educational resource and pedagogical framework designed to teach the fundamental mechanics of neural networks and gradient-based optimization. It provides a series of tutorials and code examples that guide users through building deep learning models from scratch, focusing on the implementation of core mathematical primitives and the underlying logic of backpropagation. The project distinguishes itself by providing a custom automatic differentiation engine that tracks mathematical operations in a dynamic computational graph. By implementing reverse-mode automatic differentia

    Uses topological sorting to order mathematical operations based on dependencies for correct gradient calculation.

    Jupyter Notebook
    Voir sur GitHub↗20,351
  • blender/blenderAvatar de blender

    blender/blender

    18,787Voir sur GitHub↗

    Blender is a professional 3D creation suite designed for modeling, animation, rendering, and video editing. It functions as an open-source 3D engine that provides a comprehensive framework for procedural geometry, physics simulation, and high-quality visual output. The platform is built upon a foundational architecture that utilizes data-block-based memory management and a dependency-graph-based evaluation system to handle complex scene transformations and geometry updates. The software distinguishes itself through a highly modular, node-based procedural architecture that allows users to cons

    Provides efficient bitwise operations and iteration over bit sequences for low-level data processing.

    C++3danimationb3d
    Voir sur GitHub↗18,787
  • thealgorithms/goAvatar de TheAlgorithms

    TheAlgorithms/Go

    18,085Voir sur GitHub↗

    This repository serves as a comprehensive collection of standard computer science algorithms and data structures implemented in the Go programming language. It functions as an educational resource for developers to study idiomatic code examples and master fundamental computational logic through practical, hands-on implementation. The project provides a reference for building and utilizing essential storage containers, such as linked lists, heaps, and hash maps, to organize information efficiently. It also includes a suite of proven mathematical algorithms for performing complex numerical calc

    Provides tools for graph theory analysis including traversals and shortest path calculations.

    Goalgorithmsalgorithms-implementedcommunity-driven
    Voir sur GitHub↗18,085
Préc.12345…6Suivant
  1. Home
  2. Scientific & Mathematical Computing
  3. Numerical and Mathematical Foundations
  4. Algorithms and Complexity
  5. Algorithms

Explorer les sous-tags

  • Algorithmic Learning Resources1 sous-tagEducational materials and resources focused on systematic search strategies for solving constraint satisfaction and optimization problems.
  • Algorithmic Problems6 sous-tagsCommon computational challenges involving array processing, string parsing, queue simulation, and logical puzzle solving.
  • Bit Manipulation Techniques4 sous-tagsMethods for performing operations on data at the individual bit level.
  • Computational Complexity2 sous-tagsMathematical frameworks for evaluating the time and memory efficiency of algorithms and their specific operations.
  • Development and Practice3 sous-tagsTools, frameworks, and competitive environments used to implement, test, and audit algorithmic logic, focusing on the engineering lifecycle rather than specific mathematical techniques.
  • Graph Processing5 sous-tagsSpecialized routines for traversing, ordering, and optimizing connections within graph data structures, distinct from general-purpose sorting or bitwise logic.
  • GreedyAlgorithms that make locally optimal choices at each step to find a global optimum.
  • Sorting2 sous-tagsComputational procedures and tools designed to organize elements within an array into a specific order.