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.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
68 results · page 3 of 3
Algorithms and Data Structures · Algorithms and data structures
Reuse an established prefix-match interval to build a Z array in linear time and locate a pattern with a safe separator.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Derive a take-or-skip table and recover items, then examine update direction, pseudopolynomial cost and changed problem variants.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Compare arrays and linked lists by separating lookup from updates, then consider locality, allocation, stable handles and workload requirements.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Trace queue-based and stack-based graph exploration, separating reachability, shortest edge count, predecessor paths and frontier memory.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Compare nonnegative-weight greedy finalization with repeated relaxation, including reachable negative cycles, early exit and implementation costs.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Use a coin-change counterexample and recurrence to distinguish irreversible local choices from reusing solutions to subproblems.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Track equal-key records to distinguish sorting stability, multi-key ordering, deterministic output and implementation costs.
IntermediateAlgorithms and Data Structures · Concepts and theorems
Analyze dynamic-array growth and a two-stack queue while separating sequence bounds, probabilistic expectations and per-operation latency.
IntermediateAlgorithms and Data Structures · Concepts and theorems
Define an asymptotic upper bound and distinguish it from a tight bound, a worst-case choice, and a wall-clock prediction.
IntroductoryAlgorithms and Data Structures · Experiments and implementations
Sum equal data in a packed array and a node chain, separating measured traversal from Python-specific implementation costs.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Enumerate small sorted inputs and test binary-search boundaries, duplicates and empty arrays through explicit invariants.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Separate inserted and absent datasets, vary bits, hashes and seeds, and compare every observation with the approximation.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Verify identical neighbors before comparing byte matrices and32-bit CSR payload, object sizes and process-wide RSS.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Compare equal-result dictionary workloads and observe how forced hash collisions affect equality-call counts.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Build a small job queue and verify its heap invariant, equal-priority ordering and removal behavior.
IntermediateAlgorithms and Data Structures · Experiments and implementations
Label equal-key records and test what stable sorting preserves, including a two-key multi-pass example.
IntermediateAlgorithms and Data Structures · Study guides
Compare how algorithms reduce a problem and justify choices, using a coin example where a plausible greedy rule fails.
IntroductoryAlgorithms and Data Structures · Study guides
Compare arrays, linked lists, hash tables, and heaps using lookup, insertion, removal, and ordering requirements.
IntroductoryAlgorithms and Data Structures · Study guides
Define vertices, edges, visited state, and edge weights before choosing a graph traversal for the question you need to answer.
IntroductoryAlgorithms and Data Structures · Textbook
Estimate how work grows with input size, then interpret measurements in light of constant factors, caches, and input distributions.
Introductory