Tagged articles
heap sort
13 articles · Page 1 of 1
This article reproduces MySQL's official LIMIT‑optimization example, shows how adding rows changes the ORDER BY + LIMIT result, explains the hidden priority‑queue mechanism revealed by optimizer_trace, and derives the exact row‑count threshold where the behavior switches.
LIMITMySQLheap sort
0 likes · 18 min read

This article investigates the nondeterministic behavior of MySQL when combining ORDER BY with LIMIT, reproduces the official example, identifies a critical row count threshold where the optimizer switches to a priority‑queue (heap) sort, and explains the underlying source‑code logic and its impact on query results.
MySQLORDER BYheap sort
0 likes · 19 min read

This article presents a comprehensive study of local vector retrieval optimization, covering memory‑based filtering techniques, Redis‑backed vector storage designs, and various sorting algorithms—including radix and heap‑based approaches—to achieve lower latency and higher throughput for large‑scale ad recommendation systems.
RedisVector Searchbackend optimization
0 likes · 13 min read

This article explains heap sort's time and space complexities, introduces max‑heap and min‑heap concepts, details the algorithmic steps for building and maintaining the heap, and provides a complete Java implementation with accompanying code examples.
AlgorithmComplexityJava
0 likes · 8 min read


政采云技术Jan 12, 2021 · Fundamentals
This article explains the concept of priority queues, compares various implementations including binary heaps, demonstrates insertion and deletion operations with detailed code examples from React's SchedulerMinHeap, and discusses extensions to d‑ary heaps for performance‑critical scenarios.
Reactbinary heapd-ary heap
0 likes · 15 min read

This article explains heap sort by introducing its theory, visual step‑by‑step construction of a max‑heap, a complete Python implementation, and an analysis of its time and space complexities, including detailed code walkthrough and complexity derivations.
AlgorithmComplexity AnalysisSorting Algorithm
0 likes · 7 min read

This article explains the heap sort algorithm, describing the heap data structure, the process of building a max‑heap, the sorting loop with element swaps, and provides detailed Java code examples along with key points and an illustrative example array.
Sorting Algorithmalgorithm tutorialdata structures
0 likes · 5 min read

This article explains the concept of heap sort, describes how a binary heap works, walks through a detailed Java implementation with code examples, and highlights important steps and visualizations to help readers grasp the algorithm and its practical usage.
data structuresheap sortsorting
0 likes · 6 min read

This article provides a thorough introduction to heap data structures, covering their definition, core operations such as insertion and deletion, heap sort implementation, and practical production use cases like priority queues, Top‑K queries, and TP99 calculation, all illustrated with Java code examples.
AlgorithmHeapJava
0 likes · 17 min read

This article explains the binary heap data structure, its array representation, heap property maintenance via maxHeapify, construction of a max‑heap, heap sort algorithm, and the implementation of a max‑priority queue in C, including full source code and theoretical analysis.
Algorithmsbinary heapdata structures
0 likes · 10 min read


ITPUBMar 26, 2017 · Fundamentals
This article introduces eight common internal sorting algorithms—Insertion, Shell, Selection, Bubble, Merge, Quick, Heap, and Radix—explaining their principles, detailed step-by-step procedures, time and space complexities, and stability characteristics.
Algorithm ComplexityQuick SortSorting Algorithms
0 likes · 11 min read

This article introduces seven classic sorting algorithms—Quick Sort, Merge Sort, Heap Sort, Selection Sort, Bubble Sort, Insertion Sort, and Shell Sort—explaining their principles, step-by-step procedures, and visual performance illustrations to help readers understand their operation and efficiency.
AlgorithmsQuick Sortbubble sort
0 likes · 8 min read


21CTOOct 12, 2015 · Fundamentals
This article systematically presents the principles and Python implementations of eight classic sorting algorithms—Insertion, Shell, Bubble, Quick, Selection, Heap, Merge, and Radix—offering complete code examples and detailed explanations to help readers grasp their mechanisms and performance characteristics.
AlgorithmsQuick Sortheap sort
0 likes · 10 min read
