Algorithms and data structures · Introductory
Arrays: why indexed access is constant time
Connect contiguous storage and address arithmetic to fast indexing, insertion costs, and dynamic-array growth.
Read and check your understanding →LAVACS KNOWLEDGE
Follow worked examples and complexity analysis to choose suitable algorithms and data structures.
50 articles · page 1 of 3
Algorithms and data structures · Introductory
Connect contiguous storage and address arithmetic to fast indexing, insertion costs, and dynamic-array growth.
Read and check your understanding →Algorithms and data structures · Introductory
Distinguish pointer rewiring from the traversal needed to find the insertion or removal position.
Read and check your understanding →Algorithms and data structures · Introductory
Understand bucket selection, collisions, load factor, and resizing rather than treating constant-time lookup as unconditional.
Read and check your understanding →Algorithms and data structures · Introductory
Trace insertion, removal and bottom-up construction in an array heap, distinguishing ordering, shape, lookup costs and stable priorities.
Read and check your understanding →Algorithms and data structures · Introductory
Connect ordered subtrees, search paths, deletion, and the difference between balanced and unbalanced trees.
Read and check your understanding →Algorithms and data structures · Intermediate
Understand how broad nodes and balanced height reduce page accesses in ordered indexes.
Read and check your understanding →Algorithms and data structures · Introductory
Follow characters through shared prefixes and distinguish full-key membership from prefix existence.
Read and check your understanding →Algorithms and data structures · Intermediate
Use a bit array to avoid unnecessary lookups while understanding false positives and deletion limits.
Read and check your understanding →Algorithms and data structures · Introductory
Maintain a shrinking candidate interval to search sorted arrays and locate insertion boundaries correctly.
Read and check your understanding →Algorithms and data structures · Introductory
Derive the worst-case bound from splitting and merging, and see how equality handling controls stability.
Read and check your understanding →Algorithms and data structures · Introductory
Trace partitioning around a pivot and distinguish expected performance from the quadratic worst case.
Read and check your understanding →Algorithms and data structures · Introductory
Use a queue and discovery markers to find shortest paths by number of edges in an unweighted graph.
Read and check your understanding →Algorithms and data structures · Introductory
Explore through recursion or an explicit stack, and distinguish discovered vertices from active recursion ancestors.
Read and check your understanding →Algorithms and data structures · Intermediate
Choose the smallest tentative distance and relax edges while respecting the nonnegative-weight precondition.
Read and check your understanding →Algorithms and data structures · Intermediate
Track component membership through representatives, path compression, and size-based union.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace element shifts to connect inversion counts, adaptive running time and the conditions for stable insertion sorting.
Read and check your understanding →Algorithms and data structures · Intermediate
Follow repeated minimum selection to distinguish a fixed comparison budget from a small number of exchanges.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace heap construction and repeated extraction to explain linear heap building and logarithmic restoration costs.
Read and check your understanding →Algorithms and data structures · Intermediate
Use a bounded integer key range and cumulative counts to construct a stable ordering without pairwise key comparisons.
Read and check your understanding →Algorithms and data structures · Intermediate
Follow least-significant-digit passes to see why stability preserves lower-digit order and how radix and width affect cost.
Read and check your understanding →Algorithms and data structures · Intermediate
Combine quicksort partitions with a depth-triggered heapsort fallback and small-range insertion sorting.
Read and check your understanding →Algorithms and data structures · Intermediate
Connect natural runs, short-run extension and stable merging while distinguishing Timsort’s ideas from a particular merge policy.
Read and check your understanding →Algorithms and data structures · Intermediate
Use zero-indegree vertices to produce a dependency-respecting order and recognize when a directed cycle prevents one.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace repeated edge relaxation and explain why an extra successful pass detects a reachable negative cycle.
Read and check your understanding →Use the knowledge map to find prerequisites, or follow a learning path in order.