What is upper bound and lower bound in data structure?
Answers
Answered by
4
Hey
Here is Ur answer
__________________________________________________________
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. _________________________________________________________
please mark as brilliant
Here is Ur answer
__________________________________________________________
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. _________________________________________________________
please mark as brilliant
Similar questions