Latest Definitions — Page 52 of 60
Showing entries 307–312 of 360, ordered newest first.
Newest Computer and Technology Definitions
Page 52 of 60-
Binary Search
noun · 1 definition · #54A divide-and-conquer search algorithm that locates a target value within a sorted collection by repeatedly halving the search interval.
-
Depth-First Search
noun · 1 definition · #53A graph and tree traversal algorithm that explores as far along each branch as possible before backtracking.
-
Breadth-First Search
noun · 1 definition · #52A graph and tree traversal algorithm that explores all neighboring nodes at the current depth before advancing to nodes at the next depth level.
-
Dynamic Programming
noun · 1 definition · #51An algorithmic optimization method that solves complex problems by breaking them into overlapping subproblems and storing each subproblem's solution for reuse.
-
Red-Black Tree
noun · 1 definition · #50A self-balancing binary search tree that assigns each node a red or black color to guarantee logarithmic worst-case lookup, insertion, and deletion times.
-
Ring Buffer
noun · 1 definition · #49A fixed-size, first-in, first-out data structure that treats a contiguous memory array as circular by wrapping read and write indices back to the beginning.