6 dépôts
Awesome GitHub RepositoriesBinary Search Techniques
Algorithms for locating transition points or specific values in monotonic ranges.
Distinct from Finding Classification: No candidates cover algorithmic binary search for boolean predicates.
Explore 6 awesome GitHub repositories matching scientific & mathematical computing · Binary Search Techniques. Refine with filters or upvote what's useful.
Awesome Binary Search Techniques GitHub Repositories
Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
- azl397985856/leetcode
azl397985856/leetcode
55,758Voir sur GitHubThis 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
Applies binary search logic to count elements in a sequence that satisfy specific numerical constraints.
JavaScriptalgoalgorithmalgorithms - cp-algorithms/cp-algorithms
cp-algorithms/cp-algorithms
10,805Voir sur GitHubThis project is a comprehensive reference for algorithms and data structures used to solve complex computational problems in competitive programming. It serves as a technical resource for implementing advanced mathematical programming, computational geometry, and graph theory. The repository provides detailed implementation guides for diversifying algorithmic techniques, including top-down and bottom-up dynamic programming optimization, number theory, and linear algebra. It features specific guides for complex tasks such as constructing planar graphs, solving linear Diophantine equations, and
Implements logic to determine where a monotonic boolean predicate changes state over a given range.
C++algorithm-competitionsalgorithmsalgorithms-and-data-structures - apachecn/interview
apachecn/Interview
8,944Voir sur GitHubThis project is a comprehensive knowledge base and study resource designed for mastering technical interviews. It provides structured guides, roadmaps, and curricula focused on data structures, algorithms, system design, and frontend engineering to help candidates prepare for software engineering screenings. The repository distinguishes itself by offering a holistic approach to professional advancement. Beyond technical drills, it includes a career development handbook covering resume optimization, salary benchmarking, and strategic negotiation coaching. It also provides detailed methodologie
Explains the conceptual implementation of binary search for locating elements within sorted datasets.
Jupyter Notebookinterviewkaggleleetcode - phishman3579/java-algorithms-implementation
phishman3579/java-algorithms-implementation
4,530Voir sur GitHubThis project is a comprehensive suite of Java-based implementations for standard computer science algorithms, data structures, graph analysis, and mathematical computations. It provides a collection of reference implementations for fundamental data containers, including trees, heaps, maps, tries, and lists, alongside common sorting and searching routines. The library includes a specialized suite for graph network analysis, covering shortest paths, minimum spanning trees, and maximum flow. It also provides mathematical utilities for prime testing, modular arithmetic, and Fast Fourier Transform
Provides multiple search implementations including binary, linear, and interpolation search.
Javaalgorithmdata-structuresgraph - jack-lee-hiter/algorithmsbypython
Jack-Lee-Hiter/AlgorithmsByPython
4,082Voir sur GitHubAlgorithmsByPython est une bibliothèque de référence et un dépôt éducatif fournissant des implémentations Python exécutables des fondamentaux de l'informatique. Il sert de guide complet pour les modèles algorithmiques, les structures de données fondamentales et les solutions pour la programmation compétitive et les défis d'entretiens techniques. Le projet se distingue en offrant un large éventail d'implémentations de référence, incluant un ensemble dédié de solutions pour les problèmes LeetCode courants. Il se concentre sur la traduction de la logique computationnelle théorique en code Python pratique pour un usage éducatif et pratique. Le dépôt couvre un large éventail de capacités, incluant la conception de collections linéaires, d'arbres et de graphes, ainsi que l'implémentation de stratégies de recherche et de tri. Il inclut des utilitaires pour la théorie des graphes, tels que les calculs de chemin le plus court et d'arbre couvrant minimal, et fournit des mécanismes pour l'indexation sur disque et la correspondance de motifs textuels.
Implements sequential, binary, and block-indexed search methods for retrieving elements from fixed data sets.
Python - 0xax/go-algorithms
0xAX/go-algorithms
1,949Voir sur GitHubThis library provides a comprehensive collection of fundamental computer science primitives implemented in Go. It serves as a resource for both educational purposes and production applications, offering standard tools for organizing, searching, and sorting data. The implementation leverages language-level type parameters to ensure type safety while maintaining flexibility across different data types. It utilizes interface-driven polymorphism and pointer-based memory management to define common behaviors and handle complex structures. To optimize performance, the library employs in-place data
Provides efficient search algorithms for locating items within data structures using linear, binary, and graph-based traversal.
Goalgorithmdata-structuresgo
