-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindMaxInRotatedArray.cs
More file actions
108 lines (96 loc) · 2.9 KB
/
Copy pathFindMaxInRotatedArray.cs
File metadata and controls
108 lines (96 loc) · 2.9 KB
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
using System;
using System.Collections.Generic;
namespace DA.Algorithms.Problems
{
public static class FindMaxInRotatedArray
{
/// <summary>
/// Find maximum value element in the array.
/// <para>Time Complexity - O(logn)</para>
/// </summary>
///
/// <param name="array">Sorted array.</param>
///
/// <exception cref="System.ArgumentNullException" />
///
/// <returns>
/// Return an index of the maximum value element in the array.
/// </returns>
public static int FindValue (int[] array)
{
if (array == null)
{
throw new System.ArgumentNullException ();
}
return FindValue (array, 0, array.Length - 1);
}
/// <summary>
/// Recursively find maximum value element in the array.
/// <para>Time Complexity - O(logn)</para>
/// </summary>
private static int FindValue (int[] array, int start, int end)
{
if (end <= start)
{
return array[start];
}
int middle = (start + end) / 2;
if (array[middle] > array[middle + 1])
{
return array[middle];
}
if (array[start] <= array[middle])
{
return FindValue (array, middle + 1, end);
}
else
{
return FindValue (array, start, middle - 1);
}
}
/// <summary>
/// Find maximum value index in the array.
/// <para>Time Complexity - O(logn)</para>
/// </summary>
///
/// <param name="array">Sorted array.</param>
///
/// <exception cref="System.ArgumentNullException" />
///
/// <returns>
/// Return an index of the maximum value element in the array.
/// </returns>
public static int FindIndex (int[] array)
{
if (array == null)
{
throw new System.ArgumentNullException ();
}
return FindIndex (array, 0, array.Length - 1);
}
/// <summary>
/// Recursively find maximum value index in the array.
/// <para>Time Complexity - O(logn)</para>
/// </summary>
private static int FindIndex (int[] array, int start, int end)
{
if (end <= start)
{
return start;
}
int middle = (start + end) / 2;
if (array[middle] > array[middle + 1])
{
return middle;
}
if (array[start] <= array[middle])
{
return FindIndex (array, middle + 1, end);
}
else
{
return FindIndex (array, start, middle - 1);
}
}
}
}