这个找不到的代码结果为什么不正确？

Question

#include<stdio.h>
int TWO(int arr[], int n, int sz)
{
    int l = 0;
    int r = sz - 1;
    
    while (l <= r)
    {
    int mid = l + (r - l) / 2;
        if (arr[mid] > n)
        {
            r = mid - 1;
        }
        else if (arr[mid] < n)
        {
            l = mid + 1;
        }
        else
        {
            return mid;
        }
    }
    return -1;
}
int main()
{
    int arr[] = { 1,2,3,4,5,6,7,8,9 };
    int n = 17;
    int sz = sizeof(arr) / sizeof(arr[0]);
    int ret = TWO(arr, n, sz);
    if (TWO==-1)
    {
      printf("没找到！\n");
    }
    else
    {
        printf("找到了，下标是：%d\n", ret);;
    }

    return 0;
}

Answer 1

这也太粗心了，if(TWO==-1)？ret==-1