Find Duplicate in Range 0 and n-1

Code

#include <stdio.h>

int search(int arr[],int k,int ele){
    for(int i=0;i<k;i++){
        if(arr[i]==ele){
            return arr[i];
        }
    }
}

int find_duplicate(int arr[], int n) {
    // Your logic here
    int result;
    for(int i=0;i<n;i++){
        result= search(arr+i,n-i,arr[i]);
    }
    return result;
}

int main() {
    int n;
    scanf("%d", &n);

    int arr[100];
    for (int i = 0; i < n; i++) scanf("%d", &arr[i]);

    int result = find_duplicate(arr, n);
    printf("%d", result);
    return 0;
}

Solving Approach

Simple brute force approach, take up one element , search in the remaining array , if found return , simple