FilesExpand file tree

 main

/

SearchInRotatedSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

72 lines (53 loc) · 1.72 KB

 main

/

SearchInRotatedSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

72 lines (53 loc) · 1.72 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

/******************************************************************************

Leet Code :33. Search in Rotated Sorted Array

Link : https://leetcode.com/problems/search-in-rotated-sorted-array/

*******************************************************************************/

class SearchInRotatedSortedArray {

// This is an example of binarySearch problem

public int search(int[] nums, int target) {

int pivot = pivotElement(nums);

int bin = binarySearch(nums,target,0,pivot);

if(bin!=-1){

return bin;

}

else{

return binarySearch(nums,target,pivot+1,nums.length-1);

}

}

// If we can find the pivot element then we can easly aoply binary search in left and right of

// pivot element .

int pivotElement(int[] array) {

int start = 0;

int end = array.length - 1;

while (start <= end) {

int mid = start + (end - start) / 2;

if (mid < end && array[mid] > array[mid + 1]) {

return mid;

}

if (mid > start && array[mid] < array[mid - 1]) {

return mid - 1;

}

if (array[start] > array[mid]) {

end = mid - 1;

} else {

start = mid + 1;

}

}

return -1;

}

int binarySearch(int[] nums, int target, int start, int end){

while(start<=end){

int mid = start + (end - start)/2;

if(nums[mid]==target){

return mid;

}

else if(nums[mid]>target){

end =mid -1;

}

else{

start = mid + 1;

}

}

return -1;

}

}