Given two strings of digits, determine which string, if any, has the earliest digit which is lower than the other string's digit at the same index.
Do note that this differs from alphabetization, as shown in the following examples:
1233999999, the second string would have the earliest lower digit.
12345000 1233999999 ^ same value ^ same value ^ same value ^ second is lower ^^^^^^ irrelevant
998, neither has the earliest lowest digit, since
99, and the
8 has no digit to compare against.
99 998 ^ same value ^ same value ^ irrelevant
- Input/output can be taken/given in any reasonable format.
- You can output any three consistent values to represent choosing the first input, the second input, or neither. (similar to decision-problem)
- Alternatively, you may use the standard output method of three-way comparison of your language of choice (if one exists)
- You may assume that there will be no leading 0s in input.
- This is code-golf, so shortest code in bytes wins.
Output is in the form
< for first input,
> for second input, and
= for equal.
999 999 = 115 116 < 116 115 > 870 789 > 33 3333 = 3333 33 = 20 2100 < 19 1200 > 2100 20 > 1200 19 < 1234 1234 = 4321 5432 < 5678 5432 > 99 998 = 12345000 1233999999 >