Search target element in Rotated and Sorted Array in Java with explanation Problem Description : Given a sorted and rotated array nums[] of size N and a target, the task is to find the target in the nums[] array. Array is sorted but it is also rotated. For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2]. Example 1 : Input: nums = [4,5,6,7,0,1,2], target = 0 Output: 4 Example 2 : Input: nums = [4,5,6,7,0,1,2], target = 8 Output: -1 Example 3 : Input: nums = [1,2,3,4,6,8,12,15], target = 2 Output : 1 Example 4 : Input: nums = [2, 4, 8, 16, 32, 0, 1], target = 5 Output: -1 Here we can use binary search, but given array is rotated so we have to apply extra logic with binary search. Solution 1 : Searching target element from rotated sorted array in Java import java . util . Scanner ; public class SearchInRotatedSortedArray { public static void main ( String [] args ) { Scanner sc = new Scanner ( System . in );
Welcome To Programming Tutorial. Here i share about Java Programming stuff. I share Java stuff with simple examples.