BestHub
Sign in
Tagged articles
6 articles
Page 1 of 1
21CTO
21CTO
Mar 13, 2026 · Fundamentals

Tony Hoare: The Genius Behind Quicksort, Null References, and a Billion‑Dollar Error

Tony Hoare, Turing Award laureate and creator of Quicksort, introduced the null reference in 1965—a design later dubbed the “billion‑dollar mistake”—and spent his career advancing programming language theory, concurrency models, and formal verification, while his public apology in 2009 spurred a wave of safer language designs.

QuickSortSoftware SecurityTony Hoare
0 likes · 12 min read
Tony Hoare: The Genius Behind Quicksort, Null References, and a Billion‑Dollar Error
IT Services Circle
IT Services Circle
Oct 2, 2025 · Backend Development

Cracking Baidu's C++/PHP Interview: Key Questions, Answers, and QuickSort Code

This article examines the diminishing premium of overseas degrees, suggests one‑year master programs for career advancement, and then provides a comprehensive Baidu interview guide covering C++/PHP fundamentals, memory allocation, networking protocols, process vs thread, Redis performance, and a complete quicksort implementation in C++.

Memory ManagementQuickSortc++
0 likes · 13 min read
Cracking Baidu's C++/PHP Interview: Key Questions, Answers, and QuickSort Code
Ops Development & AI Practice
Ops Development & AI Practice
Apr 21, 2024 · Fundamentals

Master QuickSort in Go: Dive into the Algorithm and Its Real-World Use

This article explains the QuickSort algorithm’s divide-and-conquer principle, walks through its step-by-step process, provides a complete Go implementation with code, discusses practical applications, performance considerations, and future optimization directions, offering readers a solid grasp of sorting fundamentals.

Go ProgrammingQuickSortSorting Algorithm
0 likes · 5 min read
Master QuickSort in Go: Dive into the Algorithm and Its Real-World Use
JavaEdge
JavaEdge
Jan 22, 2023 · Fundamentals

Designing a High‑Performance Sorting Function: Algorithms and Optimizations

This article examines how high‑performance sorting functions such as C's qsort() and Java's Collections.sort() are implemented, compares suitable algorithms, analyzes merge sort versus quicksort, and presents practical optimizations like median‑of‑three pivots, random pivots, recursion depth limits, and hybrid insertion sort.

QuickSortSortingalgorithm
0 likes · 7 min read
Designing a High‑Performance Sorting Function: Algorithms and Optimizations
37 Interactive Technology Team
37 Interactive Technology Team
May 31, 2019 · Fundamentals

A Comprehensive Guide to QuickSort: Principles, Implementations, Performance Characteristics, and Optimizations

This comprehensive guide explains QuickSort’s divide‑and‑conquer principle, presents two PHP‑style implementations, analyzes its O(N log N) average and O(N²) worst‑case performance, and details practical optimizations such as random pivot selection, switching to insertion sort for small sub‑arrays, three‑way and dual‑pivot variants.

Algorithm OptimizationPHPQuickSort
0 likes · 10 min read
A Comprehensive Guide to QuickSort: Principles, Implementations, Performance Characteristics, and Optimizations