Objective

Write a function that reports whether the first n values of a are in ascending order, where two equal neighbours still count as ordered.

Steps

• a points to n integers. Read exactly n of them, never a[n], and never write through the pointer.
• Return 1 when the values never decrease as you walk forward. Return 0 at the first value smaller than the one before it.
• Ascending here is the loose kind: a[i] == a[i - 1] is allowed and keeps the answer 1. Only a strict drop breaks the order.
• n of 0 returns 1, and n of 1 returns 1. Nothing to compare means nothing out of order, so an empty or single element buffer counts as sorted by convention.
• Compare the two values against each other. Subtracting them overflows when INT_MIN sits next to INT_MAX.
• The examples print what the call returns.

Objective

Write a function that reports whether the first n values of a are in ascending order, where two equal neighbours still count as ordered.

Steps

• a points to n integers. Read exactly n of them, never a[n], and never write through the pointer.
• Return 1 when the values never decrease as you walk forward. Return 0 at the first value smaller than the one before it.
• Ascending here is the loose kind: a[i] == a[i - 1] is allowed and keeps the answer 1. Only a strict drop breaks the order.
• n of 0 returns 1, and n of 1 returns 1. Nothing to compare means nothing out of order, so an empty or single element buffer counts as sorted by convention.
• Compare the two values against each other. Subtracting them overflows when INT_MIN sits next to INT_MAX.
• The examples print what the call returns.