Swipe to navigate through the chapters of this book
The two objectives of this chapter are (1) to provide an ordering of sequences of objects so they can be sorted, like individual numbers, and so any finite set of them can be generated in a natural order from the first to the last, and (2) to provide a mechanism for classifying complexity functions by their rates of growth.
Relations in general are defined, then equivalence relations, then order relations.
Relations on sequences of numbers are given, in particular Lexicographic-Order. Relations on infinite sequences of real numbers (including complexity functions of algorithms) are then covered with Big-Oh, Big-Theta, and Little-Oh notation.
Please log in to get access to this content
To get access to this content you need the following product:
- Relations: Especially on (Integer) Sequences
- Springer International Publishing
- Sequence number
- Chapter number
- Chapter 7