awesome-repositories.com
Blog
awesome-repositories.com

Descubre los mejores repositorios open-source con nuestra búsqueda potenciada por IA.

ExplorarBúsquedas curadasAlternativas open-sourceSoftware autohospedableBlogMapa del sitio
ProyectoAcerca deCómo clasificamosPrensaServidor MCP
Aviso legalPrivacidadTérminos
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

4 repositorios

Awesome GitHub RepositoriesOrder Statistics

Retrieves elements at specific ranks or calculates key ranks within tree structures.

Distinct from Ordered Data Structures: Distinct from Ordered Data Structures: focuses on rank-based retrieval rather than simple insertion order.

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

Awesome Order Statistics GitHub Repositories

Encuentra los mejores repositorios con IA.Buscaremos los repositorios que mejor coincidan usando IA.
  • oi-wiki/oi-wikiAvatar de OI-wiki

    OI-wiki/OI-wiki

    26,176Ver en 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

    Retrieves elements at specific ranks within tree structures.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    Ver en GitHub↗26,176
  • walkccc/clrsAvatar de walkccc

    walkccc/CLRS

    5,060Ver en GitHub↗

    This repository is a comprehensive collection of fully worked solutions to exercises and problems from the standard algorithms textbook by Cormen, Leiserson, Rivest, and Stein (CLRS). It serves as an educational reference for algorithm design and analysis, providing step-by-step reasoning, pseudocode, and mathematical proofs for a wide range of topics. The content spans core computer science areas: algorithm analysis with asymptotic notation, recurrence solving, and amortized cost analysis; data structure implementation and operations for binary search trees, red-black trees, B-trees, Fibonac

    Augments balanced BSTs with subtree sizes to support rank queries, order-statistic selection, and range enumeration.

    Markdownclrsintroduction-to-algorithmssolutions
    Ver en GitHub↗5,060
  • xtensor-stack/xtensorAvatar de xtensor-stack

    xtensor-stack/xtensor

    3,748Ver en GitHub↗

    xtensor is a C++ multidimensional array library for numerical computing that provides N-dimensional containers with an interface mirroring the NumPy API. It utilizes a lazy evaluation expression engine to defer numerical computations until assignment, which minimizes memory allocations and intermediate copies. The library features a foreign memory array adaptor that allows it to wrap external buffers, such as NumPy arrays, to perform numerical operations in-place without duplicating data. It further optimizes performance through lazy broadcasting and a system that manages the lifetime of temp

    Deno-xtensor finds minimums, maximums, medians, or quantiles and sorts data along specified axes.

    C++c-plus-plus-14multidimensional-arraysnumpy
    Ver en GitHub↗3,748
  • mathnet/mathnet-numericsAvatar de mathnet

    mathnet/mathnet-numerics

    3,717Ver en GitHub↗

    This project is a numerical computing library designed for scientific and engineering mathematical operations. It functions as a comprehensive linear algebra framework, a statistical analysis library, and a toolkit for mathematical optimization and numerical integration. The library is distinguished by its provider-based native acceleration, which allows managed code to be swapped for platform-native binary libraries to increase the performance of computationally intensive routines. It also supports a hybrid approach to matrix storage, implementing separate strategies for dense and sparse mat

    Retrieves the k-th smallest value from a dataset using efficient sorting or lookup methods.

    C#csharpdifferentiationfft
    Ver en GitHub↗3,717
  1. Home
  2. Scientific & Mathematical Computing
  3. Order Statistics