Partial sorting
id:
partial-sorting-297-15680314
title:
Partial sorting
text:
In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that its elements all appear in order, while partial sorting is returning a list of the k smallest elements in order. The other elements may also be sorted, as in an in-place partial sort, or may be discarded, which is common in streaming partial sorts. A common practical example of partial sorting is computing the "Top 100" of some list. In terms of in
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Partial_sorting
date created:
date modified:
2023-02-26T15:19:47Z
main entity:
{"identifier":"Q17147149","url":"https://www.wikidata.org/entity/Q17147149"}
image:
fields total:
13
integrity:
13