When the interviewer asks you to write binarysort in two ways

package com.Cx_330.Algorithm.BinarySort;

public class BinarySortDemo {

    public static void main(String[] args) {
         int[] arr=new int[100];
        for (int i = 0; i < arr.length; i++) {
            arr[i]=i+1;
        }
        System.out.println(binaryNoRecursion(arr, 67));
        System.out.println("********VS*******");
        System.out.println(binaryRecursion(arr, 67,0,arr.length-1));
    }

    public static int binaryRecursion(int[] arr, int key,int left,int right) {
        System.out.println("Recursion~~~");
        if(left>right||arr[right]<key||arr[left]>key){
            return -1;
        }
        int mid=(left+right)/2;
        if(arr[mid]>key){
            return binaryRecursion(arr,key,left,mid-1);
        }else if(arr[mid]<key){
            return binaryRecursion(arr,key,mid+1,right);
        }else {
            return mid;
        }
    }

    public st