e/Comparison sort

Information
has gloss	eng: 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) that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator obey two of the properties of a total order: # if a ≤ b and b ≤ c then a ≤ c (transitivity) # for all a and b, either a ≤ b or b ≤ a (totalness or trichotomy).
lexicalization	eng: comparison sort
instance of	(noun) an algorithm for sorting a list sorting algorithm

Meaning
Malayalam
lexicalization	mal: താരതമ്യ സോർട്ട്

Media
media:img	Balance à tabac 1850.JPG
media:img	Bubble sort animation.gif