-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathalgorithmsJava.java
More file actions
154 lines (115 loc) · 3.86 KB
/
algorithmsJava.java
File metadata and controls
154 lines (115 loc) · 3.86 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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
public class Algorithms {
public static void main(String[] args) {
int[] intArray = new int[]{2, 3, 4, 6, 7, 8, 9, 10};
int result = secondLargestElement(intArray);
System.out.println(result);
double element = 1;
double result2 = binarySearch(intArray, element);
System.out.println(result2);
double element2 = 5;
double result3 = binarySearchIndex(intArray, element2);
System.out.println(result3);
//int[] intArray2 = new int[]{12, 1, 5, 0, 55, 8, 7, 10};
//System.out.println(Arrays.toString(selectionSort(intArray2)));
}
public static int getMin(int[] array) {
int currentMin = array[0];
for (int i = 1; i < array.length; i++) {
if (array[i] < currentMin) {
currentMin = array[i];
}
}
return currentMin;
}
public static int getMax(int[] array) {
int currentMax = array[0];
for (int i = 1; i < array.length; i++) {
if (array[i] > currentMax) {
currentMax = array[i];
}
}
return currentMax;
}
public static int linearSearch(int[] array, int element) {
for (int i = 0; i < array.length; i++) {
if (array[i] == element) {
return i;
}
}
return -1;
}
public static int secondLargestElement(int[] array) {
int largestElement = -1;
int secondLargestElement = -1;
if (array[0] < array[1]) {
largestElement = array[1];
secondLargestElement = array[0];
}
else {
largestElement = array[0];
secondLargestElement = array[1];
}
for (int i = 2; i < array.length; i++) {
if (array[i] > secondLargestElement) {
secondLargestElement = array[i];
if (largestElement < secondLargestElement) {
int temp = secondLargestElement;
secondLargestElement = largestElement;
largestElement = temp;
}
}
}
return secondLargestElement;
}
public static double binarySearch(int[] array, double element) {
double start = 0;
double end = array.length;
while (start <= end) {
double mid = Math.floor((start+end)/2);
int intMid = (int) mid;
int intElement = (int) element;
if (intElement == array[intMid]) {
return intMid;
}
else if (intElement < array[intMid]) {
end = mid - 1;
}
else {
start = mid + 1;
}
}
return -1;
}
public static double binarySearchIndex(int[] array, double element) {
double start = 0;
double end = array.length;
while (start <= end) {
double mid = Math.floor((start+end)/2);
int intMid = (int) mid;
int intElement = (int) element;
if (intElement == array[intMid]) {
return intMid;
}
else if (intElement < array[intMid]) {
end = mid - 1;
}
else {
start = mid + 1;
}
}
return start;
}
public static int[] selectionSort(int[] array) {
for (int i = 0; i < array.length; i++) {
int[] newArray = Arrays.copyOfRange(array, i, array.length);
int currentMin = getMin(newArray) + i;
int temp = array[currentMin];
array[currentMin] = array[i];
array[i] = temp;
}
return array;
}
public static int[] insertionSortBinaryOptimized(int[] array) {
return array;
}
}