Data structures capture relationship between the component values such as succession or relative magnitude. Graphs data structure is a very general representation of binary relations recorded as edges between a collection of vertices. There are many variations and extensions of graphs such as labelled vertices, labelled edges, root verities, multi-edges etc. However, in this article
A set is one of the most fundamental data structure. It allows to keep a unique, unordered enumeration of elements. Ordered Lists We could use an ordered list to implement a set data structure.
|
1 2 3 4 5 6 7 8 9 10 11 |
type Set a = [a] instance SetSpec [] where empty = [] singleton a = [a] size = length member _ [] = False member a (b:x) = case compare a b of LT -> False EQ -> True GT -> member a x |
The problem: these are still linear. Binary Trees Sets can be implemented using the list as the underlying data structure,
