AI coding assistant for busy programmers

All

JavaScript

How do you perform a binary search in a given array in Java

Java

public class BinarySearch {

public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        int key = 4;
        System.out.println("Key " + key + " found at index: " + binarySearch(arr, key));
    }

private static int binarySearch(int[] inputArr, int key) {

int start = 0;
        int end = inputArr.length - 1;
        while (start <= end) {
            int mid = (start + end) / 2;
            if (key == inputArr[mid]) {
                return mid;
            }
            if (key < inputArr[mid]) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }

return -1;

}

/* Write a simple code for "How do you perform an insertion sort" in Java: */

public class InsertionSortExample{

public static void insertionSort(int array[]){

int n = array.length;

for (int j = 1; j < n; j++) {

int key = array[j];

int i = j-1;

while ( (i > -1) && ( array [i] > key ) ) {

array [i+1] = array [i];

i--;

}

array[i+1] = key;

}   //end of for loop  //end of method  //end of class}

🤖 Code Explanation

}

AI coding assistant for busy programmers

How do you perform a binary search in a given array in Java

Java

🤖 Code Explanation

More problems solved in Java