Awesome GitHub RepositoriesAlgorithms and Data Structures

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

Algorithm Visualizer is a web-based platform designed to bridge the gap between abstract code and concrete behavior by rendering logical operations into interactive animations. It functions as an educational environment where users can observe the step-by-step execution of computational logic, providing a visual browser for exploring how algorithms process data and change state in real time. The platform distinguishes itself through a custom instruction set that maps algorithmic operations to graphical primitives, ensuring consistent rendering across different programming languages. By utiliz

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

This project is a comprehensive library of fundamental computer science algorithms and data structures implemented in C. It provides a collection of modular, portable code blocks designed for educational purposes and integration into production software, focusing on procedural execution and direct hardware interaction. The library distinguishes itself through a focus on low-level systems programming, offering memory-efficient implementations of stacks, queues, linked lists, and trees. It includes specialized suites for cryptographic data protection, audio signal processing, and network commun

This project is a JavaScript algorithm library and computer science reference. It provides a collection of standard computational logic patterns and data structure implementations, including linked lists, trees, and graphs, for both educational and practical use. The codebase serves as a technical interview study guide, offering a practical resource for practicing common coding challenges and data structure manipulations. It is designed for computer science education, allowing users to study how classic algorithms work by reviewing and running implementations of established logic patterns. T

هذا المشروع عبارة عن مكتبة خوارزميات C# ومجموعة من هياكل البيانات. يعمل كمرجع لعلوم الحاسب يوفر تطبيقات عملية لأنماط الفرز، والبحث، واجتياز الرسوم البيانية الكلاسيكية. تتضمن المكتبة مجموعة أدوات معالجة نصوص مخصصة لتحليل تشابه النصوص، وحساب مسافات التحرير، وإدارة عمليات البحث القائمة على البادئة. كما تتميز بتطبيق لنظرية الرسوم البيانية لنمذجة علاقات الشبكة وحساب أقصر المسارات. يغطي الكود المصدري مجموعة واسعة من القدرات، بما في ذلك إدارة المجموعات الخطية والهرمية، ومعالجة وتصور بيانات الأشجار، وحساب المتتاليات الرقمية الرياضية.

هذا المشروع عبارة عن مكتبة خوارزميات فرز JavaScript ومورد برمجي تعليمي. يوفر مجموعة من تطبيقات الفرز الكلاسيكية المصممة لتعليم المنطق الكامن وراء تقنيات ترتيب البيانات الشائعة. يعمل المشروع كدليل مرجعي تقني، حيث يقدم تطبيقات لطرق فرز مختلفة إلى جانب تفسيرات لتعقيد الوقت والمساحة الخاص بها. يركز على تطبيق أنماط علوم الكمبيوتر الأساسية داخل بيئة JavaScript. تغطي المكتبة مجموعة واسعة من خوارزميات الفرز، بما في ذلك الطرق القائمة على المقارنة مثل الفرز السريع (quicksort)، وفرز الدمج (merge sort)، وفرز الكومة (heapsort)، بالإضافة إلى التقنيات القائمة على التوزيع مثل فرز الجذر (radix sort) وفرز الدلو (bucket sort). كما تتضمن تطبيقات تكرارية أساسية مثل فرز الفقاعة (bubble sort) وفرز الإدراج (insertion sort).

This project is a frontend development blog and technical knowledge base. It serves as a software engineering reference and web development portfolio, providing a curated collection of articles and notes on front-end engineering, programming patterns, and computer science fundamentals. The site focuses on frontend engineering education and technical knowledge management. It covers software architecture patterns, web development workflows, and engineering interview preparation through the organization of technical guides and tutorials. The project's scope includes the documentation of browser

OneOf is a C# discriminated union library and source generator that provides functional sum types. It serves as a strongly typed polymorphism tool, allowing developers to define method parameters and return values that can be exactly one of several specific types. The project implements functional programming patterns to replace generic base classes with type-safe unions. It utilizes a source generator to automatically produce the boilerplate code required to manage these union type hierarchies during compilation. The library provides mechanisms for pattern matching and union value extractio

A very fast SIMD-first image comparison library (with nodejs API)

Clever Algorithms: Nature-Inspired Programming Recipes

Computational parallel flows on top of GenStage

Monads and other dark magic for Elixir

Throw in the towel.

Elixir State machine thin layer for structs

Algorithm and data-structure library for .NET 4.5.2+/Netstandard 2.0+. Algorithmia contains sophisticated algorithms and data-structures like graphs, priority queues, command, undo-redo and more.

A Circuit Breaker for Erlang

A blazing fast matrix library for Elixir/Erlang with C implementation using CBLAS.

Finite State Machine data structure

Upgrade your pipelines with monads.