Java : Program to Find Maximum Element in an Array using Binary Search

```
import java.util.Random;
```
```
 
```
```
public class Maximum_Using_Binary 
```
```
{
```
```
    static int N = 20;
```
```
    static int []sequence = new int[N];
```
```
 
```
```
    public static void sort()
```
```
    {
```
```
       int i, j, temp;
```
```
        for (i = 1; i< N; i++) 
```
```
        {
```
```
            j = i;
```
```
            temp = sequence[i]; 
```



//check next number is less than previous number, assume  temp = 69, sequence[j-1] = 99



//40 60 99(sequence[j-1]) 69(temp) 71 90 33 83 7 79 49 67 24 23 36 46 55 13 98 8

            while (j > 0 && temp < sequence[j-1])

```
            {
```



    //If it is less, then get previous number(99) to next number location(69)

                sequence[j] = sequence[j-1];

                j = j-1;  //Point j to 60th location, bez to check in next loop 69 with 60

```
            }
```

            sequence[j] = temp;    //checking number finally add it to current location

```
        }        
```
```
    }
```
```
 
```

    public static void main(String args[])

```
    {
```
```
        Random random = new Random();
```
```
 
```
```
        for(int i=0; i<N; i++)
```

            sequence[i] = Math.abs(random.nextInt(100));

        System.out.println("The sequence is :");

```
        for(int i=0; i<N; i++)
```

            System.out.print(sequence[i] + " ");

```
 
```
```
        sort();
```
```
 
```

        System.out.println("\nThe maximum element in the sequence is : " + sequence[N-1]);

```
    }
```
```
}
```

Output:


The sequence is :
40 60 99 69 71 90 33 83 7 79 49 67 24 23 36 46 55 13 98 8 
The miaximum element in the sequence is : 99

Java Crack

Tuesday, 26 September 2017

Java : Program to Find Maximum Element in an Array using Binary Search

Java : Program to Find Maximum Element in an Array using Binary Search

No comments:

Post a Comment