Data Structures & Algorithms

Sequentially scanning elements when no useful index/order exists.

In-place comparison sorting using heap construction followed by repeated root extraction.

Stable O(n log n) divide-and-conquer sorting by merging sorted halves.

Stable in-place insertion into a sorted prefix, efficient for small or nearly sorted inputs.

Partition-based sorting with O(n log n) expected time, pivot selection, and worst-case safeguards.

Repeatedly selecting the minimum/maximum with quadratic comparisons and few swaps.

Comparing sorting algorithms by time, space, stability, adaptiveness, locality, and data constraints.

The basic CAS semantics, use cases, ABA problem, and CPU atomic-instruction implementation.

A historical CAS-based lock-free queue implementation note and its safe-memory-reclamation boundary.