c++二分查找数组中的数

#include <cstdio>
#include <iostream>
using namespace std;
int S[5]={57,39,24,65,21};
int sort(int *S){
    for(int i = 0 ; i<5 ;i++){
        for(int j = 0 ; j < 5 ; j++){
            if(S[i]>S[j]){
                int temp=S[i];
                S[i]=S[j];
                S[j] = temp;
            }
        }
    }
}
int binary_search(int goal,int *S){
    int mid;
    int left = 0;
    int right = 5;
    while(left<right){
        mid = (left+right)/2;
        if(S[mid]==goal){
            return 1;
        }else if(S[mid]>goal){
            right = mid;
        }else{
            left = mid+1;
        }
    }
    return 0;
}
int main(){
    int fin  = binary_search(24,S);
    cout<<fin;
    return 0;
}