an odd–even sort or odd–even transposition sort (also known as brick sort[self-published source] or parity sort) is a relatively simple sorting algorithm...

integer arithmetic. even ± even = even; even ± odd = odd; odd ± odd = even; even × even = even; even × odd = even; odd × odd = odd; By construction in...

Batcher's odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where...

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order...

intersections of two lines. Bubble sort is a stable sort algorithm, like insertion sort. Odd–even sort is a parallel version of bubble sort, for message passing systems...

comparisons is typically higher than Batcher's odd-even sort, many of the consecutive operations in a bitonic sort retain a locality of reference, making implementations...

comparison sorts include: Quicksort Heapsort Shellsort Merge sort Introsort Insertion sort Selection sort Bubble sort Odd–even sort Cocktail shaker sort Cycle...

proved that all even perfect numbers are of this form. This is known as the Euclid–Euler theorem. It is not known whether there are any odd perfect numbers...

bubble sort, thus bubblization can reduce ghost legs to primes. Since, as mentioned above, an odd number of legs produces an odd permutation and an even number...

list alternately from front to back and back to front Comb sort Gnome sort Odd–even sort Quicksort: divide list into two, with all items on the first...