# chefyuan/algorithm-base

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/chefyuan-algorithm-base).**

10,702 stars · 1,551 forks · MIT

## Links

- GitHub: https://github.com/chefyuan/algorithm-base
- awesome-repositories: https://awesome-repositories.com/repository/chefyuan-algorithm-base.md

## Topics

`algorithms` `base` `interview-practice` `interview-questions` `java` `leetcode` `offer` `programmers`

## Description

algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works.

The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mechanisms such as sliding windows and monotonic stacks.

The resource covers a broad range of fundamental computer science topics, including sorting and searching algorithms, hash table collision resolution, and linked list manipulation. It provides visual breakdowns of tree traversals and stack-based expression parsing, as well as simulated implementations of array-based techniques like prefix sums and binary search variants.

The content is structured as a technical resource for those preparing for software engineering interviews and studying the internal mechanics of data structures.

## Tags

### Education & Learning Resources

- [Algorithm Visualizers](https://awesome-repositories.com/f/education-learning-resources/algorithm-visualizers.md) — Renders step-by-step execution of data structures and algorithms through interactive animation simulations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode523%E8%BF%9E%E7%BB%AD%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md))
- [Data Structure Visualizers](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/data-structure-implementations/data-structure-visualizers.md) — Renders step-by-step animation simulations to explain the operations of hash tables, stacks, queues, and trees. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Algorithm and Data Structure Guides](https://awesome-repositories.com/f/education-learning-resources/algorithm-and-data-structure-guides.md) — Contrasts the time and space complexity of linked lists versus arrays for insertion and deletion operations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E9%93%BE%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Algorithm Demonstrations](https://awesome-repositories.com/f/education-learning-resources/algorithm-demonstrations.md) — Demonstrates the mechanics of sorting and searching algorithms, such as quicksort and binary search, through simulations. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Complexity Analysis](https://awesome-repositories.com/f/education-learning-resources/algorithm-study-guides/sorting-algorithms/complexity-analysis.md) — Analyzes sorting algorithms based on stability, time complexity, and memory usage. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md))
- [Algorithmic Performance Comparison](https://awesome-repositories.com/f/education-learning-resources/algorithmic-performance-comparison.md) — Provides comparative analysis and prose descriptions to contrast brute force and optimized algorithmic techniques. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode560%E5%92%8C%E4%B8%BAK%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md))
- [Conceptual-to-Code Mappings](https://awesome-repositories.com/f/education-learning-resources/conceptual-to-code-mappings.md) — Links prose explanations and visual simulations directly to multi-language source code implementations.
- [Data Structure Implementations](https://awesome-repositories.com/f/education-learning-resources/data-structure-implementations.md) — Provides educational code implementations for the internal mechanics of stacks, queues, linked lists, and binary trees.
- [Mechanism](https://awesome-repositories.com/f/education-learning-resources/educational-literature/illustrations/mechanism.md) — Illustrates the last-in-first-out mechanism using animations to demonstrate push and pop operations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Algorithm and Data Structure Guides](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/algorithm-data-structure-guides.md) — Provides conceptual explanations and multi-language implementations for fundamental data structures like stacks, queues, and trees.
- [Algorithm Implementation Guides](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/algorithm-data-structure-guides/algorithm-guides/algorithm-implementation-guides.md) — Provides a step-by-step implementation guide and annotated code for the Knuth-Morris-Pratt algorithm. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/KMP.md))
- [Binary Trees](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/algorithm-data-structure-guides/binary-trees.md) — Illustrates the definitions and characteristics of binary tree architectures through animations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E5%9F%BA%E7%A1%80.md))
- [Algorithm Implementations](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/general-collections-and-study/algorithm-implementations.md) — Provides practical code implementations and step-by-step logic for solving classic algorithmic problems. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode1%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md))
- [Algorithmic Pattern Visualizations](https://awesome-repositories.com/f/education-learning-resources/educational-resources/career-interview-community/interview-preparation-resources/coding-interview-resources/algorithmic-pattern-visualizations.md) — Provides visual walkthroughs for recurring algorithmic patterns in string matching, binary search, and tree traversals. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Execution Visualizers](https://awesome-repositories.com/f/education-learning-resources/execution-visualizers.md) — Renders step-by-step algorithmic state changes and pointer updates through simulated animations.
- [Logic State Simulations](https://awesome-repositories.com/f/education-learning-resources/logic-state-simulations.md) — Models data structure transitions by tracking internal state changes across discrete execution steps.
- [Pattern-Based Algorithm Categorization](https://awesome-repositories.com/f/education-learning-resources/pattern-based-algorithm-categorization.md) — Organizes diverse problems by underlying mechanisms such as sliding windows and monotonic stacks.
- [Problem Solving Guides](https://awesome-repositories.com/f/education-learning-resources/problem-solving-guides.md) — Offers guides combining problem descriptions, logic analysis using techniques like prefix sums, and code implementations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode523%E8%BF%9E%E7%BB%AD%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md))
- [Mechanism Illustrations](https://awesome-repositories.com/f/education-learning-resources/queue-implementations/stack-based-queues/mechanism-illustrations.md) — Illustrates the first-in-first-out mechanism using animations to demonstrate enqueueing and dequeueing. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Sliding Window Algorithms](https://awesome-repositories.com/f/education-learning-resources/sliding-window-algorithms.md) — Uses animations and diagrams to demonstrate how sliding window boundaries and sums update across array segments. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode1052%E7%88%B1%E7%94%9F%E6%B0%94%E7%9A%84%E4%B9%A6%E5%BA%97%E8%80%81%E6%9D%BF.md))
- [Process Mechanics Visuals](https://awesome-repositories.com/f/education-learning-resources/sorting-algorithm-tutorials/process-mechanics-visuals.md) — Explains sorting element movement and swapping through detailed animations and visual guides. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E7%AE%80%E5%8D%95%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F.md))
- [Sorting Algorithms](https://awesome-repositories.com/f/education-learning-resources/sorting-algorithms.md) — Compares the time complexity and execution flow of different sorting methods through visual guides.
- [Execution Simulations](https://awesome-repositories.com/f/education-learning-resources/sorting-algorithms/execution-simulations.md) — Provides animated, step-by-step execution simulations for quick sort, merge sort, and heap sort. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Strategy Comparisons](https://awesome-repositories.com/f/education-learning-resources/sorting-algorithms/strategy-comparisons.md) — Provides comparative analysis of quick sort and merge sort regarding stability and memory usage. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md))
- [Step-Wise Execution Walkthroughs](https://awesome-repositories.com/f/education-learning-resources/step-wise-execution-walkthroughs.md) — Provides sequential snapshots of memory and pointer states to illustrate complex algorithmic flows.
- [String Search Algorithm Study](https://awesome-repositories.com/f/education-learning-resources/string-search-algorithm-study.md) — Provides a study guide on basic sequential substring search techniques for technical interviews. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/BF%E7%AE%97%E6%B3%95.md))
- [Algorithm Visualizations](https://awesome-repositories.com/f/education-learning-resources/technical-domain-education/technical-academic-domains/algorithmic-design-analysis/algorithm-visualizations.md) — Uses animation simulations and guides to visually explain the internal mechanics of algorithmic problem-solving. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode560%E5%92%8C%E4%B8%BAK%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md))
- [Technical Interview Guides](https://awesome-repositories.com/f/education-learning-resources/technical-interview-guides.md) — Serves as a technical resource for preparing for software engineering interviews with logic analysis and execution flows.
- [Technical Interview Preparation](https://awesome-repositories.com/f/education-learning-resources/technical-interview-preparation.md) — Offers study guides for common coding challenges and optimized problem solving strategies for software engineering interviews.
- [Tree Data Structures](https://awesome-repositories.com/f/education-learning-resources/tree-data-structures.md) — Demonstrates the definitions and properties of general, complete, and skewed binary trees. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E5%9F%BA%E7%A1%80.md))
- [Tree Traversal Simulations](https://awesome-repositories.com/f/education-learning-resources/tree-traversal-simulations.md) — Provides animated simulations of preorder, inorder, postorder, and level-order binary tree traversal techniques. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E5%9F%BA%E7%A1%80.md))
- [Algorithm Interview Challenges](https://awesome-repositories.com/f/education-learning-resources/algorithm-interview-challenges.md) — Applies algorithmic concepts to classic technical interview challenges through animated guides and simulations. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Binary Search Variants](https://awesome-repositories.com/f/education-learning-resources/binary-search-variants.md) — Analyzes binary search applications for non-standard structures, such as rotated sorted arrays. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/leetcode33%E4%B8%8D%E5%AE%8C%E5%85%A8%E6%9C%89%E5%BA%8F%E6%9F%A5%E6%89%BE%E7%9B%AE%E6%A0%87%E5%85%83%E7%B4%A0(%E4%B8%8D%E5%8C%85%E5%90%AB%E9%87%8D%E5%A4%8D%E5%80%BC).md))
- [Circular Queue Logic](https://awesome-repositories.com/f/education-learning-resources/data-structure-implementations/queues/circular-queue-logic.md) — Explains the use of wrap-around arrays in circular queues to prevent false overflow. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Stack-Based Minimum Finders](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/data-ordering-and-retrieval/minimum-value-finders/stack-based-minimum-finders.md) — Implements a stack that retrieves the minimum element in constant time using a secondary tracking stack. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E5%8D%95%E8%B0%83%E6%A0%88/%E6%9C%80%E5%B0%8F%E6%A0%88.md))
- [Interview-Focused Problem Sets](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/general-collections-and-study/algorithmic-problem-sets/interview-focused-problem-sets.md) — Features step-by-step animated breakdowns of curated algorithmic problems commonly found on technical interview platforms. ([source](https://github.com/chefyuan/algorithm-base#readme))
- [Reordering Simulations](https://awesome-repositories.com/f/education-learning-resources/linked-list-algorithms/reordering-simulations.md) — Groups nodes by positional parity using animations and step-by-step explanations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode328%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.md))
- [Matrix Search Algorithms](https://awesome-repositories.com/f/education-learning-resources/matrix-search-algorithms.md) — Implements optimized strategies for performing binary search within a sorted 2D matrix. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md))
- [MaxQueue Visualizations](https://awesome-repositories.com/f/education-learning-resources/queue-implementations/maxqueue-visualizations.md) — Demonstrates the use of a monotonic deque alongside a standard queue to retrieve maximum elements in constant time. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E5%8D%95%E8%B0%83%E6%A0%88/%E5%89%91%E6%8C%87offer59%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md))
- [Stack-Based](https://awesome-repositories.com/f/education-learning-resources/queue-implementations/stack-based.md) — Simulates stack behavior using queue operations through step-by-step animations and code examples. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97/225.%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md))
- [Stack-Based Queues](https://awesome-repositories.com/f/education-learning-resources/queue-implementations/stack-based-queues.md) — Simulates a first-in-first-out queue using two last-in-first-out stacks. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97/%E5%89%91%E6%8C%87Offer09%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md))
- [Search Algorithms](https://awesome-repositories.com/f/education-learning-resources/search-algorithms.md) — Explores binary search and string matching techniques through animated walkthroughs and case analysis.
- [Algorithmic Problem Solving](https://awesome-repositories.com/f/education-learning-resources/technical-domain-education/computer-science-education/algorithmic-problem-solving.md) — Combines conceptual analysis, problem descriptions, and code to solve specific data structure challenges. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode1248%E5%AF%BB%E6%89%BE%E4%BC%98%E7%BE%8E%E5%AD%90%E6%95%B0%E7%BB%84.md))
- [Space-Optimized Traversals](https://awesome-repositories.com/f/education-learning-resources/technical-domain-education/technical-academic-domains/algorithmic-design-analysis/tree-data-structures/tree-traversal-utilities/space-optimized-traversals.md) — Demonstrates space-efficient post-order traversal using the Morris method. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E7%BB%AD%E9%81%8D%E5%8E%86%20(%E8%BF%AD%E4%BB%A3).md))
- [Unique Element Identification](https://awesome-repositories.com/f/education-learning-resources/unique-element-identification.md) — Demonstrates how to identify a unique element in an array where other elements repeat three times. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%B1%82%E6%AC%A1%E6%95%B0%E9%97%AE%E9%A2%98/%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B02.md))
- [Visual Algorithm Breakdowns](https://awesome-repositories.com/f/education-learning-resources/visual-algorithm-breakdowns.md) — Provides graphical breakdowns and animated simulations of common algorithmic coding challenges. ([source](https://github.com/chefyuan/algorithm-base/blob/main/README.md))

### Scientific & Mathematical Computing

- [Binary Search Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/binary-search-algorithms.md) — Explains the fundamental logic of binary search through conceptual analogies and animation simulations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E8%AF%A6%E8%A7%A3.md))
- [Complexity Analysis](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/computational-complexity/complexity-analysis.md) — Analyzes time and space complexity of sorting processes across best-case and worst-case scenarios. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md))
- [Sorting Complexity](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/computational-complexity/sorting-complexity.md) — Evaluates sorting performance metrics based on gap sequences and various data distributions. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F.md))
- [Prefix Sum Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/prefix-sum-algorithms.md) — Implements prefix sum arrays to enable efficient calculation of subarray interval sums. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode724%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E7%B4%A2%E5%BC%95.md))
- [Consecutive Ones Streak Detection](https://awesome-repositories.com/f/scientific-mathematical-computing/array-manipulations/consecutive-ones-streak-detection.md) — Determines the longest sequence of consecutive ones in binary arrays using sliding window techniques. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode485%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md))
- [Bitwise Unique Element Search](https://awesome-repositories.com/f/scientific-mathematical-computing/bitwise-unique-element-search.md) — Visualizes the use of XOR operations and bit-masking to isolate unique elements in a dataset. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%B1%82%E6%AC%A1%E6%95%B0%E9%97%AE%E9%A2%98/%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B03.md))
- [Boundary Index Locators](https://awesome-repositories.com/f/scientific-mathematical-computing/conditional-element-indexing/boundary-index-locators.md) — Identifies the index of the first element greater than or the last element smaller than a target. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/%E6%89%BE%E5%87%BA%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%A4%A7%E4%BA%8E%E6%88%96%E5%B0%8F%E4%BA%8E%E7%9B%AE%E6%A0%87%E7%9A%84%E7%B4%A2%E5%BC%95.md))
- [Linked List Cycle Detectors](https://awesome-repositories.com/f/scientific-mathematical-computing/linked-list-cycle-detectors.md) — Implements and visualizes algorithms for detecting loops in linked lists using dual-pointers or hash-based tracking. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode142%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A82.md))
- [Matrix Pattern Traversal Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-pattern-traversal-algorithms.md) — Implements and visualizes the traversal of a 2D array in a clockwise spiral pattern. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode59%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B52.md))
- [Inversion Counting Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/inversion-counting-algorithms.md) — Calculates the number of out-of-order pairs in a sequence by extending the merge sort algorithm. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E9%80%86%E5%BA%8F%E5%AF%B9%E9%97%AE%E9%A2%98.md))
- [Binary Tree Traversals](https://awesome-repositories.com/f/scientific-mathematical-computing/recursive-tree-traversal-algorithms/binary-tree-traversals.md) — Explains binary tree post-order traversal using animation simulations of the Morris method. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E7%BB%AD%E9%81%8D%E5%8E%86%EF%BC%88Morris%EF%BC%89.md))
- [Rotated Sorted Array Search](https://awesome-repositories.com/f/scientific-mathematical-computing/sorted-array-management/rotated-sorted-array-search.md) — Provides a step-by-step case analysis to find the minimum value in a rotated sorted array. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/leetcode153%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC.md))

### Software Engineering & Architecture

- [Complexity Analysis](https://awesome-repositories.com/f/software-engineering-architecture/complexity-analysis.md) — Evaluates multiple algorithmic strategies side-by-side based on time complexity, space complexity, and stability.
- [Circular Buffer Visualizations](https://awesome-repositories.com/f/software-engineering-architecture/execution-control/asynchronous-task-queueing/job-queues/queue-visualizers/circular-buffer-visualizations.md) — Visualizes how circular buffers resolve false overflow by connecting the head and tail of a queue. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Operation Visualizations](https://awesome-repositories.com/f/software-engineering-architecture/execution-control/asynchronous-task-queueing/job-queues/queue-visualizers/operation-visualizations.md) — Demonstrates enqueueing and dequeueing elements using animations to simulate the first-in-first-out mechanism. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Parsing Visualizations](https://awesome-repositories.com/f/software-engineering-architecture/stacks/expression-parsing/parsing-visualizations.md) — Converts infix expressions to postfix notation and evaluates them using stack-based animations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [String Matching Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-matching-algorithms.md) — Provides animated simulations of brute-force string matching algorithms for educational purposes. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/BF%E7%AE%97%E6%B3%95.md))
- [Prefix-Based Pattern Matching Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/prefix-based-pattern-matching-algorithms.md) — Demonstrates prefix-based pattern matching logic through simulations of the KMP algorithm. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/KMP.md))
- [Tree Traversal Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/tree-traversal-algorithms.md) — Illustrates how traversal algorithms manage pointers and visit nodes through visual breakdowns. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86(Morris).md))
- [Duplicate Element Detection](https://awesome-repositories.com/f/software-engineering-architecture/duplicate-element-detection.md) — Uses hash maps and sliding window techniques to detect duplicate elements within a specific distance. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode219%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A02.md))
- [Postfix Expression Evaluators](https://awesome-repositories.com/f/software-engineering-architecture/expression-transformers/notation-converters/postfix-expression-evaluators.md) — Computes the result of a reverse Polish notation expression by pushing and popping operands. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Hash Function Design](https://awesome-repositories.com/f/software-engineering-architecture/hash-tables/hash-function-design.md) — Constructs mapping rules using digital analysis and division to distribute keys uniformly. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Value Removal Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/in-place-array-manipulations/value-removal-algorithms.md) — Demonstrates in-place algorithms for removing specified values from arrays using brute-force and two-pointer strategies. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode27%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md))
- [Linked Lists](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists.md) — Provides guides and code demonstrating how to construct, traverse, and delete nodes within linked lists. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E9%93%BE%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Element Location Strategies](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/element-location-strategies.md) — Visualizes techniques for locating specific nodes, such as the middle node, using fast and slow pointers. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/%E9%9D%A2%E8%AF%95%E9%A2%98%2002.03.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%97%B4%E8%8A%82%E7%82%B9.md))
- [Insertion Simulations](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/insertion-simulations.md) — Uses animations and diagrams to show how to traverse linked lists and insert elements correctly. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode147%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md))
- [Intersection Identification](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/intersection-identification.md) — Identifies the first common node between two intersecting linked lists using dual pointers or hash sets. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/%E5%89%91%E6%8C%87Offer52%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9.md))
- [Linked List Manipulation Utilities](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-manipulation-utilities.md) — Illustrates the internal mechanics and pointer movements of singly, doubly, and circular linked lists. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E9%93%BE%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Linked List Sorting Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-sorting-algorithms.md) — Simulates the rearrangement of elements during a linked list insertion sort through animated sequences. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode147%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md))
- [Linked List Topology Transformers](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-topology-transformers.md) — Reverses singly linked lists by modifying node directions, visualized through pointer tracking animations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode206%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md))
- [Partitioning Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/partitioning-algorithms.md) — Separates linked lists into two partitions based on a value threshold while preserving relative order. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E9%93%BE%E8%A1%A8%E7%AF%87/leetcode86%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.md))
- [Monotone Stack Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/monotone-stack-algorithms.md) — Identifies the next greater element in an array using monotonic stack logic and animations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E5%8D%95%E8%B0%83%E6%A0%88/leetcode739%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md))
- [Bubble Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/bubble-sorts.md) — Explains the logic of bubble sort by comparing and swapping adjacent elements. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%86%92%E6%B3%A1%E6%8E%92%E5%BA%8F.md))
- [Counting Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/counting-sorts.md) — Demonstrates frequency-based counting sort using animations and step-by-step guides. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E8%AE%A1%E6%95%B0%E6%8E%92%E5%BA%8F.md))
- [Heap Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/heap-sorts.md) — Demonstrates the process of building max-heaps to sort arrays through animations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%A0%86%E6%8E%92%E5%BA%8F.md))
- [Insertion Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/insertion-sorts.md) — Uses animations to show elements moving from unsorted to sorted sections in insertion sort. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E7%9B%B4%E6%8E%A5%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.md))
- [Missing Positive Integer Detections](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/linear-time-integer-sorts/missing-positive-integer-detections.md) — Identifies the smallest missing positive integer in unsorted arrays using in-place swapping or auxiliary storage. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E7%BB%84%E7%AF%87/leetcode41%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md))
- [Merge Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/merge-sorts.md) — Explains the divide-and-conquer logic of merge sort using step-by-step breakdowns. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F.md))
- [Quick Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/quick-sorts.md) — Explains quick sort through conceptual guides and comparative analysis of partitioning strategies. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md))
- [Selection Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/selection-sorts.md) — Explains selection sort through conceptual walkthroughs, visual simulations, and complexity analysis. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E7%AE%80%E5%8D%95%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F.md))
- [Shell Sorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/shell-sorts.md) — Demonstrates how shell sort organizes data through gaps using animation simulations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F.md))
- [Gap Sequence Analysis](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/shell-sorts/gap-sequence-analysis.md) — Analyzes the effects of different gap sequences, such as Shell and Sedgewick, on sorting time complexity. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F.md))
- [Sorted Array Searchers](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/sorted-array-searchers.md) — Locates the first and last indices of a target value within sorted arrays using logarithmic search techniques. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E5%8F%8A%E5%85%B6%E5%8F%98%E7%A7%8D/leetcode34%E6%9F%A5%E6%89%BE%E7%AC%AC%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md))
- [Sorting Algorithm Variants](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/sorting-algorithm-variants.md) — Implements advanced quick sort techniques including three-way partitioning and median-of-three pivot selection. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md))
- [Expression Parsing](https://awesome-repositories.com/f/software-engineering-architecture/stacks/expression-parsing.md) — Transforms standard mathematical expressions into reverse Polish notation using stack-based traversal. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Stack-Based String Processing](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/stack-based-string-processing.md) — Removes adjacent duplicate characters from a string using a stack to demonstrate push and pop operations. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/%E5%85%B3%E4%BA%8E%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Storage Tradeoff Analysis](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/tree-based-storage/storage-tradeoff-analysis.md) — Compares sequential array-based storage and linked pointer-based storage for binary trees. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E5%9F%BA%E7%A1%80.md))

### Data & Databases

- [Storage Tradeoff Analysis](https://awesome-repositories.com/f/data-databases/append-only-storage-engines/tree-based-storage/storage-tradeoff-analysis.md) — Explains the performance and memory trade-offs between sequential array storage and linked pointer storage for trees. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%91%E5%9F%BA%E7%A1%80.md))
- [Pivot Index Locators](https://awesome-repositories.com/f/data-databases/array-searching/pivot-index-locators.md) — Simulates the process of finding a center index where left and right element sums are equal. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E5%89%8D%E7%BC%80%E5%92%8C/leetcode724%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E7%B4%A2%E5%BC%95.md))
- [Collision Handling Techniques](https://awesome-repositories.com/f/data-databases/hash-tables/collision-handling-techniques.md) — Demonstrates how to handle hash collisions using open addressing, chaining, and re-hashing. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Collision Resolution Strategies](https://awesome-repositories.com/f/data-databases/hash-tables/collision-resolution-strategies.md) — Manages multiple keys mapping to the same slot using chaining and open addressing strategies. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Custom Hashing Implementations](https://awesome-repositories.com/f/data-databases/hash-tables/custom-hashing-implementations.md) — Implements custom hashing functions using division, multiplication, folding, and digital analysis to calculate storage addresses. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Efficiency Analysis](https://awesome-repositories.com/f/data-databases/hash-tables/efficiency-analysis.md) — Evaluates hash search efficiency by analyzing hash function uniformity and load factors. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Hash Index Calculations](https://awesome-repositories.com/f/data-databases/hash-tag-key-mapping/hash-index-calculations.md) — Provides simulations for calculating unique indices for records to enable constant-time lookups. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))
- [Hash Table Operations](https://awesome-repositories.com/f/data-databases/key-value-pair-managers/hash-table-operations.md) — Visualizes hash table operations including mapping keys to addresses and handling collisions with probing. ([source](https://github.com/chefyuan/algorithm-base/blob/main/animation-simulation/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%92%8C%E7%AE%97%E6%B3%95/Hash%E8%A1%A8%E7%9A%84%E9%82%A3%E4%BA%9B%E4%BA%8B.md))