ComputerScience

a sub graph of a connected graph that contains all vertices, but no cycles

a distribution-based sorting algorithm that works by dividing elements into buckets

a sequential data structure where we can add an element to the tail, or remove an element from the head.

a data structure where only the top element is accessible

a popular divide-and-conquer sorting algorithm

the smallest polygon that contains a set of points

a method of solving a problem where a function calls itself

the study of graphs

A 32-bit number encoding, either signed (-2B to 2B) or unsigned (0 to 4B).

a key-value pair data structure with constant time data access