Comparison sort
id:
comparison-sort-321-12709936
title:
Comparison sort
text:
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator forms a total preorder over the data, with: if a ≤ b and b ≤ c then a ≤ c (transitivity)
for all a and b, a ≤ b or b ≤ a (connexity). It is possible that both a ≤ b and b ≤ a; in this case either may come first in the sorted list. In a stable so
brand slug:
wiki
category slug:
encyclopedia
description:
Type of sorting algorithm that works by comparing pairs of elements
original url:
https://en.wikipedia.org/wiki/Comparison_sort
date created:
date modified:
2024-01-04T12:54:46Z
main entity:
{"identifier":"Q2632949","url":"https://www.wikidata.org/entity/Q2632949"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/17/Balance_%C3%A0_tabac_1850.JPG","width":960,"height":899}
fields total:
13
integrity:
15