3 个仓库
Algorithms that rearrange elements so only a subset of indices contain their final sorted values.
Distinct from Sorted Array Searchers: Distinct from Sorted Array Searchers as it modifies the array layout to partially order elements rather than searching for a value.
Explore 3 awesome GitHub repositories matching software engineering & architecture · Partial Array Sorting. Refine with filters or upvote what's useful.
ndarray 是一个 Rust 的多维数组库,用作线性代数框架和科学计算工具。它提供了创建和操作 n 维数组的核心基础设施,既充当并行数组处理器,也充当数值数据分析工具包。 该库的独特之处在于提供高效的切片和内存视图,允许在不复制的情况下共享数据。它利用优化的后端数学库进行高速矩阵乘法,并将繁重的数学迭代分布到多个 CPU 线程上以加速处理。 该项目涵盖了广泛的数学运算,包括逐元素算术、基于轴的数据聚合和点积计算。它还包括用于数组操作的全面实用程序,如重塑、展平、堆叠和坐标网格生成,以及对随机数组生成和序列化的支持。
Reorders elements so a specific value reaches its final sorted position with smaller elements preceding it.
MoreLINQ is a functional programming toolkit and extension library for .NET that augments LINQ to Objects with advanced operators for sequence manipulation and analysis. It provides a set of tools for declarative data transformation, leveraging lazy evaluation and composition to handle complex object sequences. The library is distinguished by its specialized capabilities for combinatorial generation, including the production of permutations, subsets, and Cartesian products. It also provides advanced sequence joining options, such as full, left, and right outer joins, and supports complex data
Combines sorting and limiting to efficiently retrieve the top N items from a sequence.
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 rearranges elements so specific indices contain values they would hold when fully sorted.