I have a collection of $ N$ ordered pairs, $ $ \{\{x_{1},y_{1}\},\cdots,\{x_{N},y_{N}\}\}$ $ These ordered pairs can have at most one entry in common, i.e., if $ x_{i}=x_{j} \left(y_{i}=y_{j}\right)$ for some $ i$ and $ j$ , then $ y_{i}\neq y_{j} \left(x_{i}\neq x_{j}\right)$ . I want to sort this list of ordered pairs from smallestRead more