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

Descoperă cele mai bune repository-uri open source cu căutare AI.

ExploreazăCăutări recomandateAlternative open-sourceSoftware self-hostedBlogHartă site
ProiectServer MCPDespreCum realizăm clasamentulPresă
LegalConfidențialitateTermeni
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

111 repository-uri

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

Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
  • donnemartin/system-design-primerAvatar donnemartin

    donnemartin/system-design-primer

    353,387Vezi pe GitHub↗

    Acest proiect este o resursă educațională cuprinzătoare și un ghid de studiu axat pe arhitectura sistemelor distribuite și designul infrastructurii backend. Oferă un curriculum structurat pentru stăpânirea principiilor de scalabilitate, fiabilitate și performanță necesare pentru a proiecta sisteme software complexe. Repository-ul se distinge prin oferirea unei abordări metodice pentru pregătirea interviurilor tehnice, încorporând tipare de design, compromisuri arhitecturale și instrumente de repetiție spațiată pentru a ajuta utilizatorii să rețină concepte complexe. Pune accent pe analiza bazată pe constrângeri, învățând utilizatorii cum să evalueze cerințele concurente precum latența, consistența și disponibilitatea atunci când schițează design-uri arhitecturale. Conținutul acoperă un spectru larg de capabilități de design de sistem, inclusiv strategii pentru scalarea bazelor de date, gestionarea traficului și optimizarea infrastructurii. Detaliază tehnici pentru scalarea orizontală, caching-ul pe mai multe niveluri, comunicarea asincronă și descoperirea serviciilor, oferind în același timp framework-uri pentru efectuarea estimărilor de resurse și planificarea capacității. Documentația este organizată ca un ghid de studiu, oferind o cale sistematică prin fundamentele ingineriei backend și designul sistemelor la scară largă.

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

    Pythondesigndesign-patternsdesign-system
    Vezi pe GitHub↗353,387
  • facebook/reactAvatar facebook

    facebook/react

    245,669Vezi pe GitHub↗

    React este o bibliotecă JavaScript pentru construirea de interfețe utilizator bazată pe o arhitectură orientată pe componente și flux de date unidirecțional.

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

    JavaScriptjavascriptuifrontend
    Vezi pe GitHub↗245,669
  • thealgorithms/pythonAvatar TheAlgorithms

    TheAlgorithms/Python

    221,992Vezi pe GitHub↗

    Acest proiect este un repository cuprinzător de implementări computaționale verificate, conceput pentru a servi drept resursă educațională pentru informatică și rezolvarea problemelor algoritmice. Oferă o colecție structurată de exemple de cod care acoperă structuri de date fundamentale, operațiuni matematice și concepte de bază de programare, permițând utilizatorilor să studieze logica și complexitatea din spatele diferitelor metode computaționale. Repository-ul se distinge printr-un tipar de implementare modular, bazat pe referințe, care organizează codul în spații de nume logice. Această abordare facilitează execuția independentă și claritatea educațională, permițând utilizatorilor să exploreze evoluția strategiilor computaționale de la abordări naive de tip brute-force la soluții optimizate, de înaltă performanță. Prin decuplarea abstracțiilor structurilor de date de operațiunile algoritmice, proiectul asigură că implementările rămân interschimbabile și ușor de analizat. Suprafața de capabilități acoperă o gamă largă de domenii tehnice, inclusiv învățarea automată, criptografia, calculul științific și viziunea computerizată. Include implementări pentru modelare predictivă, rețele neuronale și analiză statistică, alături de instrumente pentru procesarea semnalelor digitale, gestionarea fluxului de rețea și modelarea financiară. Colecția abordează, de asemenea, nevoi matematice specializate, cum ar fi algebra liniară, calculele geometrice și manipularea biților, oferind o fundație largă pentru cercetare și aplicații de inginerie.

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

    Pythonalgorithmalgorithm-competitionsalgorithms-implemented
    Vezi pe GitHub↗221,992
  • trekhleb/javascript-algorithmsAvatar trekhleb

    trekhleb/javascript-algorithms

    196,089Vezi pe 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
    Vezi pe GitHub↗196,089
  • labuladong/fucking-algorithmAvatar labuladong

    labuladong/fucking-algorithm

    134,160Vezi pe 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
    Vezi pe GitHub↗134,160
  • fffaraz/awesome-cppAvatar fffaraz

    fffaraz/awesome-cpp

    71,817Vezi pe 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
    Vezi pe GitHub↗71,817
  • kdn251/interviewsAvatar kdn251

    kdn251/interviews

    64,941Vezi pe 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
    Vezi pe GitHub↗64,941
  • azl397985856/leetcodeAvatar azl397985856

    azl397985856/leetcode

    55,758Vezi pe 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
    Vezi pe GitHub↗55,758
  • google-research/google-researchAvatar google-research

    google-research/google-research

    38,139Vezi pe 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
    Vezi pe GitHub↗38,139
  • fxsjy/jiebaAvatar fxsjy

    fxsjy/jieba

    35,027Vezi pe 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
    Vezi pe GitHub↗35,027
  • thealgorithms/c-plus-plusAvatar TheAlgorithms

    TheAlgorithms/C-Plus-Plus

    34,361Vezi pe 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
    Vezi pe GitHub↗34,361
  • raywenderlich/swift-algorithm-clubAvatar raywenderlich

    raywenderlich/swift-algorithm-club

    29,101Vezi pe 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
    Vezi pe GitHub↗29,101
  • kodecocodes/swift-algorithm-clubAvatar kodecocodes

    kodecocodes/swift-algorithm-club

    29,099Vezi pe 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
    Vezi pe GitHub↗29,099
  • oi-wiki/oi-wikiAvatar OI-wiki

    OI-wiki/OI-wiki

    26,176Vezi pe 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
    Vezi pe GitHub↗26,176
  • valyala/fasthttpAvatar valyala

    valyala/fasthttp

    23,264Vezi pe 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
    Vezi pe GitHub↗23,264
  • wangzheng0822/algoAvatar wangzheng0822

    wangzheng0822/algo

    23,159Vezi pe 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
    Vezi pe GitHub↗23,159
  • qax-os/excelizeAvatar qax-os

    qax-os/excelize

    20,682Vezi pe 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
    Vezi pe GitHub↗20,682
  • karpathy/nn-zero-to-heroAvatar karpathy

    karpathy/nn-zero-to-hero

    20,351Vezi pe 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
    Vezi pe GitHub↗20,351
  • blender/blenderAvatar blender

    blender/blender

    18,787Vezi pe 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
    Vezi pe GitHub↗18,787
  • thealgorithms/goAvatar TheAlgorithms

    TheAlgorithms/Go

    18,085Vezi pe 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
    Vezi pe GitHub↗18,085
Înapoi12345…6Înainte
  1. Home
  2. Scientific & Mathematical Computing
  3. Numerical and Mathematical Foundations
  4. Algorithms and Complexity
  5. Algorithms

Explorează sub-etichetele

  • Algorithmic Learning Resources1 sub-tagEducational materials and resources focused on systematic search strategies for solving constraint satisfaction and optimization problems.
  • Algorithmic Problems6 sub-tag-uriCommon computational challenges involving array processing, string parsing, queue simulation, and logical puzzle solving.
  • Bit Manipulation Techniques4 sub-tag-uriMethods for performing operations on data at the individual bit level.
  • Computational Complexity2 sub-tag-uriMathematical frameworks for evaluating the time and memory efficiency of algorithms and their specific operations.
  • Development and Practice3 sub-tag-uriTools, frameworks, and competitive environments used to implement, test, and audit algorithmic logic, focusing on the engineering lifecycle rather than specific mathematical techniques.
  • Graph Processing5 sub-tag-uriSpecialized 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 sub-tag-uriComputational procedures and tools designed to organize elements within an array into a specific order.