SEARCH LAVACS

Find a topic across LavaCS

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

541 results · page 2 of 23

Algorithms and Data Structures · Algorithms and data structures

KMP: reuse a matched prefix after a mismatch

Build prefix-function fallback information to search without moving backward through the text and retain overlapping matches.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Merge sort: combine already sorted sequences

Derive the worst-case bound from splitting and merging, and see how equality handling controls stability.

Introductory

Algorithms and Data Structures · Algorithms and data structures

Preserve segment-tree versions by path copying

Copy only a point-update path and inspect range sums, shared references and lifetime conditions across retained versions.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Select one rank with three-way Quickselect

Track duplicate ranks and unexamined values while distinguishing input mutation, expected linear work and worst-case cost.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Rabin–Karp: filter windows with a rolling hash

Update a fingerprint as a text window slides, then distinguish verified matches, collision risks and worst-case work.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Red–black trees

Follow red-black invariants through a small insertion trace, then distinguish recoloring, rotations, deletion repair and implementation variants.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Sample an unknown-length stream with a reservoir

Derive uniform inclusion with bounded storage, distinguishing seeded reproducibility, distribution observations and restart state.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Build ordered shortcuts with a skip list

Trace predecessor links during insertion and deletion, separating randomized expectations from a fixed-height teaching implementation.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Maintain interval state with a sliding window

Compare shortest sum intervals and longest distinct-character windows, including repair order and a negative-value counterexample.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Timsort: merge the ordered runs already present

Connect natural runs, short-run extension and stable merging while distinguishing Timsort’s ideas from a particular merge policy.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Topological sorting: order tasks by dependencies

Use zero-indegree vertices to produce a dependency-respecting order and recognize when a directed cycle prevents one.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Find a target pair from two endpoints

Use sorted order to justify eliminating pairs, then distinguish duplicates, original indices and the single-item boundary.

Intermediate