1/10
Looks like no tags are added yet.
Algorithm
A step-by-step procedure for performing some task in a finite amount of time.
Data Structure
A systematic way of organizing and accessing data.
Primitive Operation
A basic computation performed by an algorithm—such as evaluating an expression, assigning a value, comparing two numbers, indexing into an array, calling a method, or returning from a method—assumed to execute in a constant amount of time in the RAM model.
Space Complexity
A measure of the total working storage memory required by an algorithm, represented by the formula S(P)=C+S(instance).
Fixed Part (C)
The component of space complexity that accounts for memory required by instruction space (byte code), simple variables, fixed-size variables, and constants, independent of input size.
Variable Part (S(instance))
The component of space complexity that depends on the problem input size n, covering memory dynamically allocated for dynamic variables, function call stacks, and recursive calls.
Big-Oh Notation (O)
An asymptotic notation stating that f(n) is O(g(n)) if the growth rate of f(n) is asymptotically less than or equal to g(n), providing an upper bound on running time or space.
Big-Omega Notation (Ω)
An asymptotic notation stating that f(n) is Ω(g(n)) if f(n) is asymptotically greater than or equal to g(n), providing an asymptotic lower bound.
Big-Theta Notation (Θ)
An asymptotic notation stating that f(n) is Θ(g(n)) if f(n) is asymptotically equal to g(n), providing an asymptotically tight bound.
Divide-and-Conquer Paradigm
An algorithm design paradigm that divides input data S into two or more disjoint subsets, conqu