44 مستودعات
Algorithms for selecting items from a collection based on probabilistic weights.
Distinct from Selection Lists: Distinct from UI selection lists: focuses on the mathematical logic of weighted selection rather than interactive UI components.
Explore 44 awesome GitHub repositories matching software engineering & architecture · Randomized Selection Algorithms. 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
Implements randomized selection algorithms to return elements based on proportional weights.
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
The project selects a fixed number of random elements from a data stream ensuring equal probability.
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
Provides random collection sampling using swaps and reservoir sampling to select fixed-size subsets.
This project is a feature-rich Go client library designed for interacting with Redis. It serves as a comprehensive interface for managing remote data stores, enabling developers to execute standard database commands, handle complex data structures, and perform asynchronous operations within Go applications. The library distinguishes itself through its support for advanced Redis capabilities, including connection pooling, pipelining, and transactional integrity. It provides specialized primitives for managing distributed clusters, including automated topology updates and request routing to sha
Enables random sampling of stored data for discovery or testing purposes.
StatsD is a metrics aggregator and UDP collection server that collects system counters and timers. It functions as a time-series data forwarder, receiving high-frequency metric updates via a lightweight line protocol and summarizing them before flushing the data to a backend. The project features a pluggable metrics backend framework, allowing aggregated statistics to be routed to various third-party monitoring services or time-series databases such as Graphite. It supports horizontal scaling and high availability through a proxy ring distribution system that forwards incoming packets across
Reduces the volume of timing data by randomly sampling a subset of events to minimize overhead.
Memcached is a high-performance, distributed, in-memory key-value storage and request routing engine. It functions as a volatile data store designed to accelerate dynamic applications by caching objects in RAM, thereby reducing backend database load and providing sub-millisecond response times. The system utilizes a specialized architecture that organizes memory into fixed-size slabs to minimize fragmentation and maximize throughput for high-concurrency workloads. The project distinguishes itself through a multi-threaded, lock-friendly design that scales across CPU cores and supports complex
Distributes traffic by selecting target pools at random from available options.
Genact is a terminal activity simulator and fake log generator designed to create the appearance of professional development and system administration work. It functions as a command line simulation tool that outputs a stream of believable system messages to mimic background computer processing. The tool operates as a terminal screensaver that can prevent a computer from entering an idle or sleep state by maintaining a continuous process of simulated technical activity. It supports multiple predefined scenes and provides controls for simulation speed and run duration. The project includes ca
Picks simulated log events from predefined sets using probability weights for varied output patterns.
This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas
Selects a fixed number of elements from a data stream of unknown size with equal probability.
Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL database. It provides sub-millisecond read and write access to data stored in RAM and can operate as a vector database for indexing high-dimensional embeddings. The system supports a wide range of data storage and synchronization primitives, including the management of strings, hashes, lists, sets, and JSON documents. It enables real-time data operations through atomic transactions, hybrid persistence using snapshots and append-only logs, and high-availability configurations
Selects a random subset of element IDs from a vector set to surface varied samples.
Bogus is a fake data generator for .NET applications, including C#, F#, and VB.NET. It provides a deterministic mock data engine and an object configuration mapper to produce realistic profiles, addresses, and financial records. The library differentiates itself through a localization data provider that generates region-specific identifiers across various international languages and locales. It ensures reproducibility across executions by using seed values to control the sequence of generated data. The project covers wide-ranging data synthesis capabilities, including the generation of netwo
Picks random items or subsets from collections using probabilistic weighted selection algorithms.
PathPlanning is a library of animated path planning algorithms that includes implementations of A-star, Dijkstra, RRT, and spline-based trajectory generation for both 2D and 3D environments. The project provides a collection of motion planning algorithms that demonstrate how robots can find collision-free paths through continuous spaces, with each algorithm rendered as a step-by-step visual animation to show how the search or tree grows over time. The library covers three main categories of path planning: sampling-based methods like RRT, RRT-star, and BIT-star that grow trees by randomly samp
Generates paths by randomly sampling configuration space with RRT, RRT-star, and BIT-star algorithms.
This project is an educational resource and a collection of instructional materials for performing data manipulation and statistical analysis using Python. It provides a comprehensive set of guides and code examples for using the Pandas, NumPy, and Matplotlib libraries to analyze structured data. The resource includes a dedicated guide for reshaping, cleaning, and aggregating tabular data and time series via Pandas, alongside a reference for high-performance vectorized operations and linear algebra using NumPy. It also features tutorials for creating publication-quality charts, distribution p
Provides methods for randomly reshuffling row order or extracting random subsets of data.
VisiData is a terminal-based interactive data analysis tool and browser designed for exploring, filtering, and sorting large tabular datasets. It functions as a structured data inspector that loads and flattens complex formats like JSON, XML, and PCAP into interactive sheets, as well as a terminal file manager for navigating directories and performing staged filesystem operations. The project distinguishes itself by rendering data visualizations, such as scatter plots and histograms, directly in the terminal using Unicode Braille characters. It provides a Python-based data wrangling environme
Selects a random population sample of a specified number of rows from the dataset.
itsy-bitsy-data-structures is a collection of fundamental computer science data structures implemented in JavaScript. It serves as an educational resource and algorithm study guide, providing simplified code implementations of classic data organization patterns to demonstrate internal logic and usage. The project provides clear and concise JavaScript implementations of stacks, queues, and linked lists. These examples are designed for learning, technical interview preparation, and studying the mechanical behavior of core data structures through code. The implementations utilize various comput
Provides constant-time element retrieval using numeric index mapping within lists.
LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Selects a random element from a sequence when the total number of items is not known in advance, using reservoir sampling.
Autoscraper هي مكتبة كشط ويب تلقائية ومستخرج بيانات قائم على الأنماط يتعلم قواعد الاستخراج من بيانات العينة. يحدد ويسترجع النصوص وعناوين URL وعناصر HTML من صفحات الويب عن طريق تحليل قيم العينة لتكرار أنماط البيانات عبر عناوين URL مختلفة. يعمل النظام كمدير نموذج كشط ويب، مما يسمح للمستخدمين بحفظ وإعادة تحميل القواعد المستفادة للحفاظ على استخراج بيانات متسق. يدعم تصدير واستيراد قواعد الكشط إلى نظام ملفات محلي لتجنب تكرار عملية التدريب لنفس الموقع. تغطي المكتبة استخراج بيانات الويب المؤتمت وحصاد محتوى الويب من خلال تعلم الأنماط القائم على العينة واسترجاع العناصر الموضعية. يمكنها استرجاع كل من نقاط بيانات محددة وجميع العناصر الموجودة على صفحة تطابق الأنماط المحددة من بيانات العينة الأولية.
Fetches specific data points by matching the exact index and order of elements found in training samples.
This project is a generative art engine designed to create large collections of unique images by layering assets with assigned rarity weights and blending modes. It functions as an art generator that produces unique image sets and corresponding JSON metadata files for use in blockchain-based digital collections. The engine features a trait rarity manager that controls the frequency of specific visual attributes through filename-based weighting. It also includes a pixel art converter that transforms generated image collections into pixelated versions using configurable downsampling ratios. Th
Implements weighted-random selection algorithms to determine asset usage based on filename-assigned rarity.
imbalanced-learn is a dataset balancing framework and Python machine learning extension designed to resample training data and reduce the impact of class imbalance. It provides a toolkit of algorithms for adjusting class distributions to improve model performance on minority class prediction. As a scikit-learn resampling library, it extends the ecosystem with specialized tools for balancing datasets through over-sampling and under-sampling techniques. This allows for the correction of skewed class proportions to reduce model bias toward the majority class. The library implements the scikit-l
Generates synthetic minority samples by interpolating between existing data points to expand the minority class boundary.
This is an interactive Python tutorial delivered as a collection of Jupyter notebooks. It is designed as a structured learning path for beginners, teaching fundamental language concepts through a sequence of lessons that combine explanatory text with runnable code cells and embedded practice exercises. Each notebook is a self-contained unit that introduces a topic, demonstrates it with a minimal code example, and then asks the learner to write code themselves, receiving immediate feedback from the browser-based execution environment. The curriculum is built on a progressive concept-stacking mo
Teaches retrieving elements by zero-based position as a fundamental list operation.
collect.js is a dependency-free JavaScript library that provides a fluent, chainable interface for manipulating arrays and objects. It mirrors the Laravel Collection API, offering a consistent set of methods for data transformation across JavaScript and Laravel backend environments. The library stores collection data as plain arrays internally and supports fluent method chaining, where each method returns a new collection instance. The library distinguishes itself by closely replicating the Laravel Collection API in JavaScript, mapping each PHP method to an equivalent JavaScript implementatio
Provides methods to pick random items from a collection or shuffle the entire order.