Sortedness First Violation Finder
Find the first adjacent inversion in a nondecreasing numeric list; exact equal keys are accepted as sorted.
Description
Find the first adjacent inversion in a nondecreasing numeric list; exact equal keys are accepted as sorted.
A list is nondecreasing when no adjacent value is smaller than its predecessor. The first witness locates a local violation.
When to use this tool
Find the first adjacent inversion in a nondecreasing numeric list; exact equal keys are accepted as sorted.
- Prepare the supplied values fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter values. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.sorted, result.violation. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Scan left to right for the first decrease and return sorted false with the neighboring index pair. Otherwise return true and null.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| values | values. | List of finite numbers; at most 128 entries |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.sorted | Flag for sorted under the exact condition described above. |
| result.violation | The violation list in the ordering and representation described above. |
{
"input": {
"values": [
1,
3,
2,
0
]
},
"output": {
"result": {
"sorted": false,
"violation": [
1,
2
]
}
}
}Limitations and assumptions
- Equal values are allowed. Empty and singleton lists are sorted under this convention.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Choose the tie policy and whether you need values, original indexes, sorted positions or one-based ranks. Use a complete sort verifier when a local stability or adjacent-comparison check is insufficient.
References
Similar or alternative tools
- Bottom K Cutoff Tie Partitioner
Partition a numeric bottom-K cutoff into strict selections and all tied candidates, reporting how many ties are needed without arbitrarily breaking them.
- Competition Rank Tie Table
Assign one-based ascending competition numeric ranks; exact numeric ties are preserved according to the stated policy.