Skip to content
Tagged articles

heap sort

13 articles · Page 1 of 1
IEG Growth Platform Technology Team
IEG Growth Platform Technology Team
Mar 21, 2022 · Backend Development

Optimization of Local Vector Retrieval: Filtering, Storage, and Sorting Strategies

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
Optimization of Local Vector Retrieval: Filtering, Storage, and Sorting Strategies
政采云技术
政采云技术
Jan 12, 2021 · Fundamentals

Understanding Priority Queues and Binary Heaps with React Source Code

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
Understanding Priority Queues and Binary Heaps with React Source Code
360 Tech Engineering
360 Tech Engineering
Dec 11, 2020 · Fundamentals

Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation

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
Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation
Qunar Tech Salon
Qunar Tech Salon
Apr 29, 2016 · Fundamentals

Common Sorting Algorithms: Quick Sort, Merge Sort, Heap Sort, Selection Sort, Bubble Sort, Insertion Sort, and Shell Sort

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
Common Sorting Algorithms: Quick Sort, Merge Sort, Heap Sort, Selection Sort, Bubble Sort, Insertion Sort, and Shell Sort
21CTO
21CTO
Oct 12, 2015 · Fundamentals

Master Classic Sorting Algorithms in Python (Insertion to Radix)

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
Master Classic Sorting Algorithms in Python (Insertion to Radix)