Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

X + Y sorting

+ Save concept

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

18 relations: Cartesian product, Communications of the ACM, Comparison sort, Computer science, Elwyn Berlekamp, Fare, Fast Fourier transform, Integer sorting, List of unsolved problems in computer science, Michael Fredman, Non-constructive algorithm existence proofs, Ordered pair, Random-access machine, Shortest path problem, Sorting algorithm, Time complexity, Word (computer architecture), 3SUM.

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.

New!!: X + Y sorting and Cartesian product · See more »

Communications of the ACM

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

New!!: X + Y sorting and Communications of the ACM · See more »

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.

New!!: X + Y sorting and Comparison sort · See more »

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.

New!!: X + Y sorting and Computer science · See more »

Elwyn Berlekamp

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

New!!: X + Y sorting and Elwyn Berlekamp · See more »

Fare

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

New!!: X + Y sorting and Fare · See more »

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.

New!!: X + Y sorting and Fast Fourier transform · See more »

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.

New!!: X + Y sorting and Integer sorting · See more »

List of unsolved problems in computer science

This article is a list of unsolved problems in computer science.

New!!: X + Y sorting and List of unsolved problems in computer science · See more »

Michael Fredman

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

New!!: X + Y sorting and Michael Fredman · See more »

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.

New!!: X + Y sorting and Non-constructive algorithm existence proofs · See more »

Ordered pair

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

New!!: X + Y sorting and Ordered pair · See more »

Random-access machine

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

New!!: X + Y sorting and Random-access machine · See more »

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.

New!!: X + Y sorting and Shortest path problem · See more »

Sorting algorithm

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

New!!: X + Y sorting and Sorting algorithm · See more »

Time complexity

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

New!!: X + Y sorting and Time complexity · See more »

Word (computer architecture)

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

New!!: X + Y sorting and Word (computer architecture) · See more »

3SUM

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

New!!: X + Y sorting and 3SUM · See more »

References

[1] https://en.wikipedia.org/wiki/X_%2B_Y_sorting

OutgoingIncoming
Hey! We are on Facebook now! »