SEARCH LAVACS

Find a topic across LavaCS

Search textbooks, study guides, six encyclopedias, experiments and comparisons.

68 results · page 1 of 3

Algorithms and Data Structures · Algorithms and data structures

Arrays: why indexed access is constant time

Connect contiguous storage and address arithmetic to fast indexing, insertion costs, and dynamic-array growth.

Introductory

Algorithms and Data Structures · Algorithms and data structures

AVL trees

Understand AVL balance through insertion traces and rotations, including double rotations, metadata maintenance and deletion behavior.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Binary-search the smallest feasible answer

Use shipping capacity to derive monotonic feasibility, a closed search interval, termination and the cost of each decision.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Represent bounded sets with bits

Map set operations onto bits, mask bounded complements and compare dense universes with sparse large IDs.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Circular buffers

Trace circular-buffer head and tail indexes, distinguish empty from full, and examine wraparound, overflow and producer-consumer ordering assumptions.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Deques

Understand deque operations at both ends, implementation trade-offs, bounded behavior and why individually safe operations do not make compound workflows atomic.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Discover search bounds by doubling

Search sorted sequences without a known length, defining the end marker, stable reads and first-match boundary behavior.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Floyd–Warshall: grow the allowed intermediate set

Compute all-pairs distances with a matrix recurrence while respecting the intermediate-vertex invariant and negative-cycle scope.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Hash tables: the conditions behind expected O(1)

Understand bucket selection, collisions, load factor, and resizing rather than treating constant-time lookup as unconditional.

Introductory

Algorithms and Data Structures · Algorithms and data structures

Heapsort: move the maximum into a sorted suffix

Trace heap construction and repeated extraction to explain linear heap building and logarithmic restoration costs.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Huffman coding

Trace Huffman construction from symbol frequencies, then examine prefix decoding, weighted cost, implementation complexity and format overhead.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Insertion sort: extend a sorted prefix

Trace element shifts to connect inversion counts, adaptive running time and the conditions for stable insertion sorting.

Intermediate