Sorted set (abstract data type)
In computer science, a sorted set is an abstract data type that can store unique values of another type equipped with some kind of ordering relation. As opposed to a set, a sorted set can enumerate its elements in a specific order, consistent with the order imposed on the element type.
Implementations of this abstract data type come standard in several programming languages, including Java[1], C#[2], and C++[3] (where it is called simply "set").
In practice, a sorted set often uses[citation needed] a balanced search tree for its underlying implementation.
 | This computer science article is a stub. You can help EverybodyWiki by expanding it. |
References[edit]
This article "Sorted set (abstract data type)" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Sorted set (abstract data type). Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
