-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHelper.java
More file actions
72 lines (65 loc) · 1.47 KB
/
Helper.java
File metadata and controls
72 lines (65 loc) · 1.47 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
package algorithm.sorting;
/**
* The type Helper.
*/
class Helper {
/**
* Print array.
*
* @param arr the arr
* @param arrSize the arr size
*/
static void printArray(int[] arr, int arrSize) {
for (int i = 0; i < arrSize; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
/**
* Find min int.
*
* @param arr the arr
* @param start the start
* @param end the end
* @return the int
*/
static int findMin(int[] arr, int start, int end) {
if (end <= 0 || start < 0)
return 0;
int minInd = start;
for (int i = start + 1; i <= end; i++) {
if (arr[minInd] > arr[i])
minInd = i;
}
return minInd;
}
/**
* Find max int.
*
* @param arr the arr
* @param start the start
* @param end the end
* @return the int
*/
int findMax(int[] arr, int start, int end) {
if (end <= 0 || start < 0)
return 0;
int maxInd = start;
for (int i = start + 1; i <= end; i++) {
if (arr[maxInd] < arr[i])
maxInd = i;
}
return maxInd;
}
/**
* Swap.
*
* @param array the array
* @param i the
* @param j the j
*/
static void swap(int[] array, int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}