Minimal two column numeric input data for `sort` example, with distinct permutations
问题 What's the least number of rows of two-column numeric input needed to produce four unique sort outputs for the following four options: 1. -sn -k1 2. -sn -k2 3. -sn -k1 -k2 4. -sn -k2 -k1 ? Here's a 6 row example, (with 4 unique outputs): 6 5 3 7 6 3 2 7 4 4 5 2 As a convenience, a function to count those four outputs given 2 columns of numbers, (requires the moreutils pee command), which prints the number of unique outputs: # Usage: foo c1_1 c2_1 c1_2 c2_2 ... foo() { echo "$@" | tr -s '[