<Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (March 2012) (Learn how and when to remove this template message) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (March 2012) (Learn how and when to remove this template message) </Td> </Tr> <P> In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (K, ≤) is an element of K which is greater than or equal to every element of S . The term lower bound is defined dually as an element of K which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound . The terms bounded above (bounded below) are also used in the mathematical literature for sets that have upper (respectively lower) bounds . </P> <P> For example, 5 is a lower bound for the set (5, 8, 42, 34, 13934); so is 4; but 6 is not . </P>

Upper bound and lower bound in data structure
find me the text answering this question