# Sorting Algorithm Animations and Comparisons in LeetCodeAnimation > Explore sorting algorithm animations and comparisons in the LeetCodeAnimation repository. Discover visual aids and analysis for LeetCode problem solutions. Optimize your coding practice. - Repository: [吴师兄学算法/LeetCodeAnimation](https://github.com/MisterBooo/LeetCodeAnimation) - Tags: deep-dive - Published: 2026-03-01 --- **The LeetCodeAnimation repository provides a gateway to external sorting algorithm animations and contains internal comparative analysis of sorting methods within specific LeetCode problem solutions.** The MisterBooo/LeetCodeAnimation repository is widely known for visualizing LeetCode solutions, but its coverage of **sorting algorithm animations and comparisons** follows a specific structure. Rather than hosting standalone visualizations for every classic sort, the project links to comprehensive external resources and embeds algorithmic comparisons within problem-specific articles. ## External Sorting Algorithm Animations The repository does not store local GIF or MP4 files for the ten classic sorting algorithms. Instead, it provides a curated link to an external, self-contained article and video series covering **bubble sort, selection sort, insertion sort, merge sort, quick sort, heap sort, counting sort, radix sort, bucket sort, and shell sort**. You can find this gateway in the project documentation: - [`Readme.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/Readme.md) (line 24) — Lists the link under the Chinese title "十大经典排序算法" (Ten Classic Sorting Algorithms) - [`README-En.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/README-En.md) (line 23) — Provides the English equivalent and includes a preview GIF demonstrating merge sort This external resource serves as the primary **sorting algorithm animation** reference for the repository. ## In-Repository Sorting Algorithm Comparisons While full animations live externally, the repository contains detailed **sorting algorithm comparisons** within specific LeetCode problem analyses. These comparisons evaluate time complexity and suitability rather than providing visualizations. ### Top-K Frequent Elements Analysis The most explicit comparison appears in [`0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md) (lines 42-46). This article analyzes why certain sorting approaches fail to meet the problem's complexity requirements. The text explicitly mentions: - **Bubble sort** — Cited as an example of O(n²) complexity that is unsuitable for the required solution - **Selection sort** — Referenced alongside bubble sort as another O(n²) method that cannot achieve the target efficiency - **Quick sort** — Noted as an O(n log n) algorithm that, while better than O(n²), still fails to meet the sub-O(n log n) requirement for this specific problem This comparison demonstrates how the repository uses **sorting algorithm analysis** to teach complexity trade-offs rather than simply listing implementations. ## Generating Problem-Specific Sorting Animations For developers needing to create animations for specific sorting-related LeetCode problems, the repository provides the `anima` utility. This tool generates visualizations for individual problems, though it is not a generic sorting algorithm visualizer. To generate an animation for the "Sort Colors" problem (LeetCode 75), which implements a three-way partition sort: ```bash python -m anima 0075-Sort-Colors ``` This command creates an `Animation` sub-folder within the problem directory containing the rendered GIF or MP4. The [`anima.py`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/anima.py) and [`anima/create.py`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/anima/create.py) files handle the rendering logic, but this functionality applies to specific LeetCode problem solutions rather than standalone classic sorting algorithm demonstrations. ## Summary - The repository links to external **sorting algorithm animations** for the ten classic methods via [`Readme.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/Readme.md) and [`README-En.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/README-En.md), rather than hosting the GIFs locally. - Internal **sorting algorithm comparisons** appear in problem-specific articles, notably in [`0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md), analyzing bubble sort, selection sort, and quick sort complexity. - The `anima` utility (`python -m anima`) generates animations for specific LeetCode problems like `0075-Sort-Colors`, but does not function as a general sorting visualizer. ## Frequently Asked Questions ### Does the repository contain animated GIFs for all classic sorting algorithms? No. The repository does not store local animation files for classic sorting algorithms. Instead, it provides a link in [`Readme.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/Readme.md) (line 24) and [`README-En.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/README-En.md) (line 23) to an external article and video series that covers all ten classic sorting methods with visualizations. ### Where can I find the comparative analysis of sorting algorithms? The primary comparison is located in [`0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md`](https://github.com/MisterBooo/LeetCodeAnimation/blob/main/0347-Top-K-Frequent-Elements/Article/0347-Top-K-Frequent-Elements.md) at lines 42-46. This article compares bubble sort, selection sort, and quick sort, explaining why their time complexities make them unsuitable for achieving better than O(n log n) performance on that specific problem. ### How do I generate animations for specific sorting problems? Use the `anima` command-line utility provided in the repository. For example, to create an animation for the Sort Colors problem (which uses a three-way partition sort), run `python -m anima 0075-Sort-Colors`. This generates an `Animation` folder containing the rendered GIF or MP4 for that specific LeetCode solution. ### Which sorting algorithms are compared in the Top-K Frequent Elements article? The article explicitly mentions bubble sort and selection sort as examples of O(n²) algorithms, and quick sort as an O(n log n) algorithm. It uses these examples to illustrate why the problem requires a solution with better than O(n log n) time complexity, ruling out these standard sorting approaches.