SEARCH LAVACS
Find a topic across LavaCS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
Algorithms and Data Structures · Algorithms and data structures
Use g+h priorities to guide shortest-path search, distinguishing admissibility, consistency and reopening requirements.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Combine a keyword trie, failure links and output information to find multiple patterns, including suffix and overlapping matches.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Connect contiguous storage and address arithmetic to fast indexing, insertion costs, and dynamic-array growth.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Understand AVL balance through insertion traces and rotations, including double rotations, metadata maintenance and deletion behavior.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Understand how broad nodes and balanced height reduce page accesses in ordered indexes.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Trace repeated edge relaxation and explain why an extra successful pass detects a reachable negative cycle.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Trace insertion, removal and bottom-up construction in an array heap, distinguishing ordering, shape, lookup costs and stable priorities.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Maintain a shrinking candidate interval to search sorted arrays and locate insertion boundaries correctly.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Use shipping capacity to derive monotonic feasibility, a closed search interval, termination and the cost of each decision.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Connect ordered subtrees, search paths, deletion, and the difference between balanced and unbalanced trees.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Map set operations onto bits, mask bounded complements and compare dense universes with sparse large IDs.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Use a bit array to avoid unnecessary lookups while understanding false positives and deletion limits.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Use a queue and discovery markers to find shortest paths by number of edges in an unweighted graph.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Trace circular-buffer head and tail indexes, distinguish empty from full, and examine wraparound, overflow and producer-consumer ordering assumptions.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Use a bounded integer key range and cumulative counts to construct a stable ordering without pairwise key comparisons.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Explore through recursion or an explicit stack, and distinguish discovered vertices from active recursion ancestors.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Understand deque operations at both ends, implementation trade-offs, bounded behavior and why individually safe operations do not make compound workflows atomic.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Choose the smallest tentative distance and relax edges while respecting the nonnegative-weight precondition.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Search sorted sequences without a known length, defining the end marker, stable reads and first-match boundary behavior.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Compute all-pairs distances with a matrix recurrence while respecting the intermediate-vertex invariant and negative-cycle scope.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Understand bucket selection, collisions, load factor, and resizing rather than treating constant-time lookup as unconditional.
IntroductoryAlgorithms and Data Structures · Algorithms and data structures
Trace heap construction and repeated extraction to explain linear heap building and logarithmic restoration costs.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Trace Huffman construction from symbol frequencies, then examine prefix decoding, weighted cost, implementation complexity and format overhead.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Trace element shifts to connect inversion counts, adaptive running time and the conditions for stable insertion sorting.
Intermediate