Question

How to search for an element in circular sorted integer array with Java

Answer 1

public class MyClass {
    private static int searchCircularSortedArray(int[] arr, int element) {
    	int low = 0;
    	int high = arr.length - 1;
    
    	while (low <= high) {
    		int mid = (low + high) / 2;
    
    		if (element == arr[mid]) {
    			return mid;
    		}
    
    		if (arr[mid] <= arr[high]) {
    			if (element > arr[mid] && element <= arr[high]) {
    				low = mid + 1; // search the right sorted half
    			}
    			else {
    				high = mid - 1; // search the left side
    			}
    		}
    		else {
    			if (element >= arr[low] && element < arr[mid]) {
    				high = mid - 1; // search the left sorted half
    			}
    			else {
    				low = mid + 1; // search the right side
    			}
    		}
    	}
    
    	return -1;
    }
    
    public static void main(String args[]) {
      	int[] array = {6, 9, 10, 13, 2, 3, 5, 6, 8};
	    int element = 5;

	    int index = searchCircularSortedArray(array, element);

	    if (index != -1) {
		    System.out.print("index = " + index);
	    }
	    else {
		    System.out.print("Element not found");
	    }
    }
}




/*
run:
     
index = 6

*/

 

70+ SQL courses for beginners and professionals