Odd–even sort

In computing, an odd–even sort or odd–even transposition sort (also known as brick sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics. It functions by comparing all odd/even indexed pairs of adjacent elements in the list and, if a pair is in the wrong order (the first is larger than the second) the elements are switched. The next step repeats this for even/odd indexed pairs (of adjacent elements). Then it alternates between odd/even and even/odd steps until the list is sorted.

单词	Brick sort
释义	Brick sort 英语百科 Odd–even sort In computing, an odd–even sort or odd–even transposition sort (also known as brick sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics. It functions by comparing all odd/even indexed pairs of adjacent elements in the list and, if a pair is in the wrong order (the first is larger than the second) the elements are switched. The next step repeats this for even/odd indexed pairs (of adjacent elements). Then it alternates between odd/even and even/odd steps until the list is sorted.
随便看	netinfoes net information content net information contents netinit net injection volume net inocme to net sales ratio net insurance liabilities net interception net interchange net interest Net interest margin net interest paid net international migration net inventory Net investment net investment income Net investment income per share net investment required net invisible surplus net invoice price netion Net ionic equation neti pot neti pots netiquette

Brick sort

Odd–even sort