  Communication
Free Faster access than browser!

# X + Y sorting

In computer science, X + Y sorting is the problem of sorting pairs of numbers by their sum. 

## Cartesian product

In set theory (and, usually, in other parts of mathematics), a Cartesian product is a mathematical operation that returns a set (or product set or simply product) from multiple sets.

## Communications of the ACM

Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).

## Comparison sort

A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list.

## Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

## Elwyn Berlekamp

Elwyn Ralph Berlekamp (born September 6, 1940) is an American mathematician.

## Fare

A fare is the fee paid by a passenger for use of a public transport system: rail, bus, taxi, etc.

## Fast Fourier transform

A fast Fourier transform (FFT) is an algorithm that samples a signal over a period of time (or space) and divides it into its frequency components.

## Integer sorting

In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer.

## Michael Fredman

Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at Rutgers University, United States.

## Non-constructive algorithm existence proofs

The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P (complexity) by showing an algorithm that solves it in time that is polynomial in the size of the input; etc.

## Ordered pair

In mathematics, an ordered pair (a, b) is a pair of objects.

## Random-access machine

In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines.

## Shortest path problem

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

## Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order.

## Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.

## Word (computer architecture)

In computing, a word is the natural unit of data used by a particular processor design.

## 3SUM

In computational complexity theory, the 3SUM problem asks if a given set of n real numbers contains three elements that sum to zero.

## References

Hey! We are on Facebook now! »