SEARCH LAVACS

Find a topic across LavaCS

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

68 results · page 3 of 3

Algorithms and Data Structures · Algorithms and data structures

The Z algorithm: compute prefix-match lengths

Reuse an established prefix-match interval to build a Z array in linear time and locate a pattern with a safe separator.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Choose each item once with 0–1 knapsack

Derive a take-or-skip table and recover items, then examine update direction, pseudopolynomial cost and changed problem variants.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Arrays versus linked lists

Compare arrays and linked lists by separating lookup from updates, then consider locality, allocation, stable handles and workload requirements.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Breadth-first versus depth-first search

Trace queue-based and stack-based graph exploration, separating reachability, shortest edge count, predecessor paths and frontier memory.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Dijkstra versus Bellman–Ford

Compare nonnegative-weight greedy finalization with repeated relaxation, including reachable negative cycles, early exit and implementation costs.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Greedy methods versus dynamic programming

Use a coin-change counterexample and recurrence to distinguish irreversible local choices from reusing solutions to subproblems.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Stable versus unstable sorting

Track equal-key records to distinguish sorting stability, multi-key ordering, deterministic output and implementation costs.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Measuring array and linked-list traversal

Sum equal data in a packed array and a node chain, separating measured traversal from Python-specific implementation costs.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Testing binary-search invariants

Enumerate small sorted inputs and test binary-search boundaries, duplicates and empty arrays through explicit invariants.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Measure Bloom-filter false positives by condition

Separate inserted and absent datasets, vary bits, hashes and seeds, and compare every observation with the approximation.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Compare storage for the same graph

Verify identical neighbors before comparing byte matrices and32-bit CSR payload, object sizes and process-wide RSS.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Testing hash tables across collision workloads

Compare equal-result dictionary workloads and observe how forced hash collisions affect equality-call counts.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Implementing a heap-based priority queue

Build a small job queue and verify its heap invariant, equal-priority ordering and removal behavior.

Intermediate

Algorithms and Data Structures · Experiments and implementations

Testing sorting stability with records

Label equal-key records and test what stable sorting preserves, including a two-key multi-pass example.

Intermediate