Problem with Do-While Loop in a Binary Search

Question

The idea of the program is to randomly generate 10 integers, store them in an array then use a binary search to find the values at each position of the array in 10 or less steps.
My problem is that the do-while loopisn't doing what it should be and I can't see the problem :S
Thanks in advance.
Se�n.
int counter=0, guess=500, MIN=0, MAX=0;
int arr[] = new int[10];
          for(int i=0; i<10; i++) {
      int ranNum= ( (int)(Math.random()*1000)+1 );
      arr=ranNum;
     System.out.println(ranNum);
     for(int j=0; j<10; j++) {
          do{
               if(guess>arr[j]){
                    guess=MAX;
                    guess=guess/2;
               else if(guess<arr[j]){
                    guess=MIN;
                    MAX=MIN*2;
guess=((MAX-MIN)/2)+MIN;
               else
                    guess=arr[j];
}while(guess!=arr[j]);
          System.out.println("The number at position "+j+" in the array is :"+arr[j]);
//resets the values each time the do-while loops breaks
          MIN=0;
          MAX=0;
          guess=500;

Answer 1

Looks toe like MAX and MIN are always going to be zero.