awesome-repositories.com
博客
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目关于排名机制媒体报道MCP 服务器
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

3 个仓库

Awesome GitHub RepositoriesArray Selection Algorithms

Algorithms for identifying specific elements within arrays based on rank or value constraints.

Distinct from Sorted Array Searchers: None of the candidates are suitable; they focus on sorting or general searching, whereas this is specifically about selection algorithms for multidimensional arrays.

Explore 3 awesome GitHub repositories matching software engineering & architecture · Array Selection Algorithms. Refine with filters or upvote what's useful.

Awesome Array Selection Algorithms GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • azl397985856/leetcodeazl397985856 的头像

    azl397985856/leetcode

    55,758在 GitHub 上查看↗

    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

    Implements the kth largest element selection using sorting, min-heaps, and quick-select algorithms.

    JavaScriptalgoalgorithmalgorithms
    在 GitHub 上查看↗55,758
  • mission-peace/interviewmission-peace 的头像

    mission-peace/interview

    11,306在 GitHub 上查看↗

    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

    The library identifies the kth largest value within a two-dimensional array that is sorted by both rows and columns.

    Java
    在 GitHub 上查看↗11,306
  • sharingsource/logicstack-leetcodeSharingSource 的头像

    SharingSource/LogicStack-LeetCode

    7,495在 GitHub 上查看↗

    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

    Transforms array elements into their 1-based sorted ranks using a hash map.

    algorithminterview-practiceinterview-questions
    在 GitHub 上查看↗7,495
  1. Home
  2. Software Engineering & Architecture
  3. Array Selection Algorithms

探索子标签

  • Rank-Based Selection1 个子标签Algorithms for finding an element at a specific rank, such as the kth largest, using heaps or quick-select. **Distinct from Array Selection Algorithms:** Focuses specifically on finding the element at a given rank rather than general array selection constraints.