111 مستودعات
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.
هذا المشروع عبارة عن مورد تعليمي شامل ودليل دراسي يركز على بنية الأنظمة الموزعة وتصميم البنية التحتية للـ backend. يوفر منهجاً منظماً لإتقان مبادئ القابلية للتوسع، والموثوقية، والأداء المطلوبة لتصميم أنظمة برمجية معقدة. يتميز المستودع بتقديم نهج منهجي للتحضير للمقابلات التقنية، حيث يدمج أنماط التصميم، والمقايضات المعمارية، وأدوات التكرار المتباعد لمساعدة المستخدمين على الاحتفاظ بالمفاهيم المعقدة. ويؤكد على التحليل القائم على القيود، حيث يعلم المستخدمين كيفية تقييم المتطلبات المتنافسة مثل زمن الوصول (latency)، والاتساق، والتوافر عند صياغة التصاميم المعمارية. يغطي المحتوى طيفاً واسعاً من قدرات تصميم النظام، بما في ذلك استراتيجيات توسيع قواعد البيانات، وإدارة حركة المرور، وتحسين البنية التحتية. ويفصل تقنيات التوسع الأفقي، والتخزين المؤقت متعدد الطبقات، والتواصل غير المتزامن، واكتشاف الخدمات، مع توفير أطر عمل لإجراء تقديرات الموارد وتخطيط السعة. يتم تنظيم التوثيق كدليل دراسي، مما يوفر مساراً منهجياً عبر أساسيات هندسة الـ backend وتصميم الأنظمة واسعة النطاق.
Explains algorithms used to calculate the most efficient path between nodes in a graph.
React هي مكتبة JavaScript لبناء واجهات المستخدم تعتمد على معمارية قائمة على المكونات وتدفق بيانات أحادي الاتجاه.
Copies arrays before applying sorting or reversal to avoid direct state modification.
هذا المشروع عبارة عن مستودع شامل للتنفيذات الحسابية التي تم التحقق منها والمصممة لتكون مورداً تعليمياً لعلوم الحاسوب وحل المشكلات الخوارزمية. يوفر مجموعة منظمة من أمثلة الكود التي تغطي هياكل البيانات الأساسية، والعمليات الرياضية، ومفاهيم البرمجة الأساسية، مما يسمح للمستخدمين بدراسة المنطق والتعقيد وراء الأساليب الحسابية المختلفة. يتميز المستودع بنمط تنفيذ معياري قائم على المرجع ينظم الكود في مساحات أسماء منطقية. يسهل هذا النهج التنفيذ المستقل والوضوح التعليمي، مما يمكن المستخدمين من استكشاف تطور الاستراتيجيات الحسابية من الأساليب الساذجة (brute-force) إلى الحلول المحسنة عالية الأداء. من خلال فصل تجريدات هيكل البيانات عن العمليات الخوارزمية، يضمن المشروع بقاء التنفيذات قابلة للتبديل وسهلة التحليل. يمتد نطاق القدرات عبر مجموعة واسعة من المجالات التقنية، بما في ذلك تعلم الآلة، والتشفير، والحوسبة العلمية، ورؤية الحاسوب. يتضمن تنفيذات للنمذجة التنبؤية، والشبكات العصبية، والتحليل الإحصائي، إلى جانب أدوات لمعالجة الإشارات الرقمية، وإدارة تدفق الشبكة، والنمذجة المالية. تعالج المجموعة أيضاً الاحتياجات الرياضية المتخصصة، مثل الجبر الخطي، والحسابات الهندسية، ومعالجة البتات، مما يوفر أساساً واسعاً للبحث والتطبيقات الهندسية.
Navigate through potential solution paths by systematically reverting decisions when constraints are violated.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.