Odd–even sort
id:
odd-even-sort-317-8981088
title:
Odd–even sort
text:
In computing, an odd–even sort or odd–even transposition 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 elements are switched. The next step repeats this for even/odd indexed pairs. Then it alternates
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort
date created:
date modified:
2023-12-21T16:00:14Z
main entity:
{"identifier":"Q578580","url":"https://www.wikidata.org/entity/Q578580"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/1b/Odd_even_sort_animation.gif","width":280,"height":237}
fields total:
13
integrity:
14