1#include <stdio.h>
2#include <stdlib.h>
3
4int findUnsortedSubarray(int* nums, int numsSize) {
5    int* sorted = (int*)malloc(numsSize * sizeof(int));
6    for (int i = 0; i < numsSize; i++) {
7        sorted[i] = nums[i];
8    }
9    qsort(sorted, numsSize, sizeof(int), compare);
10    int start = 0, end = numsSize - 1;
11    while (start < numsSize && nums[start] == sorted[start]) {
12        start++;
13    }
14    while (end > start && nums[end] == sorted[end]) {
15        end--;
16    }
17    free(sorted);
18    return start < end ? end - start + 1 : 0;
19}
20
21int compare(const void* a, const void* b) {
22    return (*(int*)a - *(int*)b);
23}
24
25int main() {
26    int arr[] = {2, 6, 4, 8, 10, 9, 15};
27    int length = findUnsortedSubarray(arr, 7);
28    printf("%d\n", length); // Output: 5
29    return 0;
30}