algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 05:59:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

chore: fix some comments (#5333)

Browse Source
This commit is contained in:
mountdisk
2024-08-17 01:19:15 +08:00
committed by GitHub
parent 98bee26d51
commit 7c58b190c8
5 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java
View File

@ -17,7 +17,7 @@ import java.util.Scanner;
from its initial sorted position.
Eg. For [2,5,6,8,11,12,15,18], 1 rotation gives [5,6,8,11,12,15,18,2], 2 rotations
[6,8,11,12,15,18,2,5] and so on. Finding the minimum element will take O(N) time but, we can use
Binary Search to find the mimimum element, we can reduce the complexity to O(log N). If we look
Binary Search to find the minimum element, we can reduce the complexity to O(log N). If we look
at the rotated array, to identify the minimum element (say a[i]), we observe that
a[i-1]>a[i]<a[i+1].