|
void printArray(int[] arr) {
|
|
for (int i = 0; i < arr.length; i++) {
|
|
System.out.print(arr[i]);
|
|
if (i < arr.length - 1) System.out.print(", ");
|
|
}
|
|
System.out.println();
|
|
}
|
|
|
|
void bubbleSort(int[] arr) {
|
|
int n = arr.length;
|
|
for (int i = 0; i < n - 1; i++) {
|
|
for (int j = 0; j < n - i - 1; j++) {
|
|
if (arr[j] > arr[j + 1]) {
|
|
int temp = arr[j];
|
|
arr[j] = arr[j + 1];
|
|
arr[j + 1] = temp;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int[] arr1 = {64, 34, 25, 12, 22, 11, 90};
|
|
printArray(arr1)
|
|
bubbleSort(arr1)
|
|
printArray(arr1)
|
|
|
|
int findMin(int[] arr) {
|
|
int min = arr[0];
|
|
for (int i = 1; i < arr.length; i++) {
|
|
if (arr[i] < min) min = arr[i];
|
|
}
|
|
return min;
|
|
}
|
|
|
|
int findMax(int[] arr) {
|
|
int max = arr[0];
|
|
for (int i = 1; i < arr.length; i++) {
|
|
if (arr[i] > max) max = arr[i];
|
|
}
|
|
return max;
|
|
}
|
|
|
|
int[] nums = {3, 1, 4, 1, 5, 9, 2, 6};
|
|
findMin(nums)
|
|
findMax(nums)
|
|
|
|
%methods
|
|
%quit
|