Home
About
Blog
Products
Forum
Support
Contact
Sunbelt Computer Software
PL/B Language Development and Support
Home
About
Blog
Products
Forum
Support
Contact
InterviewPrep/src/learn/ds/array/SearchRotateArray.java at master · dcodemode/InterviewPrep · GitHub
Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
dcodemode
/
InterviewPrep
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Files
Expand file tree
master
Breadcrumbs
InterviewPrep
/
src
/
learn
/
ds
/
array
/
SearchRotateArray.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
94 lines (81 loc) · 2.6 KB
master
Breadcrumbs
InterviewPrep
/
src
/
learn
/
ds
/
array
/
SearchRotateArray.java
Copy path
Top
File metadata and controls
Code
Blame
94 lines (81 loc) · 2.6 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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
package
learn
.
ds
.
array
;
/**
* @author Varma Penmetsa
*
* https://www.geeksforgeeks.org/search-an-element-in-a-sorted-and-pivoted-array/
*
* Given a rotated sorted array, perform search in O(log n) time
* Assume no duplicates
*
* Input : arr[] = {5, 6, 7, 8, 9, 10, 1, 2, 3}; key = 3
* Output : Found at index 8
*
* Input : arr[] = {5, 6, 7, 8, 9, 10, 1, 2, 3}; key = 30
* Output : Not found
*
* Input : arr[] = {30, 40, 50, 10, 20}; key = 10
* Output : Found at index 3
*/
public
class
SearchRotateArray
{
/**
* Input arr[] = {3, 4, 5, 1, 2}
* Element to Search = 1
* 1) Find out pivot point and divide the array in two sub-arrays. (pivot = 2)
* 2) Now call binary search for one of the two sub-arrays.
* (a) If element is greater than 0th element then search in left array
* (b) Else Search in right array (1 will go in else as 1 < 0th element(3))
* 3) If element is found in selected sub-array then return index
* Else return -1.
*
*/
public
static
int
search
(
int
[]
array
,
int
x
) {
int
n
=
array
.
length
;
int
pivot
=
findPivot
(
array
,
0
,
n
-
1
);
if
(
pivot
== -
1
) {
return
binarySearch
(
array
,
x
,
0
,
n
-
1
);
}
else
if
(
array
[
pivot
] ==
x
) {
return
pivot
;
}
else
if
(
array
[
0
] >
x
) {
return
binarySearch
(
array
,
x
,
pivot
+
1
,
n
-
1
);
}
else
{
return
binarySearch
(
array
,
x
,
0
,
pivot
-
1
);
}
}
// Using Binary Search, time Complexity : O(log n)
public
static
int
findPivot
(
int
[]
array
,
int
left
,
int
right
) {
if
(
left
>
right
) {
return
-
1
;
}
if
(
left
==
right
) {
return
left
;
}
int
mid
=
left
+ (
right
-
left
) /
2
;
if
(
array
[
mid
] >
array
[
mid
+
1
]) {
return
mid
;
}
else
if
(
array
[
mid
-
1
] >
array
[
mid
]) {
return
mid
-
1
;
}
if
(
array
[
left
] >=
array
[
mid
]) {
return
findPivot
(
array
,
left
,
mid
-
1
);
}
else
{
return
findPivot
(
array
,
mid
+
1
,
right
);
}
}
public
static
int
binarySearch
(
int
[]
array
,
int
x
,
int
left
,
int
right
){
while
(
left
<=
right
){
int
mid
=
left
+ (
right
-
left
) /
2
;
if
(
array
[
mid
] ==
x
){
return
mid
;
}
else
if
(
x
<
array
[
mid
]){
right
=
mid
-
1
;
}
else
{
left
=
mid
+
1
;
}
}
return
-
1
;
}
public
static
void
main
(
String
[]
args
) {
int
[]
array
= {
2
,
3
,
4
,
5
,
1
};
System
.
out
.
println
(
findPivot
(
array
,
0
,
array
.
length
-
1
));
}
}
You can’t perform that action at this time.
