Sequential table lookups and optimizations (Java)

Sequential table lookup (linear lookup):

1 Private Static voidOrdersearch (int[] arr,intnum) {2          for(inti = 0; i < arr.length; i++) {3             if(arr[i]==num) {4 System.out.println (Arr[i]);5                 return;6             }7         }8System.out.println ("Not Found");9         Ten}

Optimization scheme: The above method each cycle to determine whether I is out of bounds, you can set the Sentinel to solve the problem.

Private Static voidOrdersearch (int[] arr,intnum) {        intCount=arr.length-1; intMin=arr[0]; arr[0]=num;  while(arr[count]!=num) {Count--; }        if(min==Arr[count])        {System.out.println (Arr[count]); }Else{System.out.println ("Not Found"); }}

Sequential table lookups and optimizations (Java)