Scribd
Upload
2 views1 page

Java Array Sorting and Max Value

The document defines a sort class with a main method that gets user input of an integer array, sorts the array in descending order using a bubble sort algorithm, prints the sorted array and finds the maximum value. It contains methods to get the array from user input, print the array, perform a descending sort using bubble sort, and return the maximum value of the array.

Uploaded by

Chester Phalevi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Java Array Sorting and Max Value

The document defines a sort class with a main method that gets user input of an integer array, sorts the array in descending order using a bubble sort algorithm, prints the sorted array and finds the maximum value. It contains methods to get the array from user input, print the array, perform a descending sort using bubble sort, and return the maximum value of the array.

Uploaded by

Chester Phalevi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

class sort {

public static void main(String[] kelompok7) {


sort run = new sort();
[Link]("Input array: ");
int array[] = [Link]();
[Link]("\nArray \n");
[Link](array);
[Link]("\nArray setelah dilakukan proses sorting");
[Link]("\nPengurutan Descending");
int sorted[] = [Link](array);
[Link]("\nHasil\n");
[Link](sorted);
[Link]("\nNilai terbesar dari array: " + [Link](array));
}
int[] getArray() {
int array[];
String arrayStr[] = new [Link]([Link]).nextLine().split(" ");
array = new int[[Link]];
for (int i = 0; i < [Link]; i++) {
array[i] = [Link](arrayStr[i]);
}
return array;
}
void showArray(int array[]) {
for (int i = 0; i < [Link]; i++) {
[Link](array[i]);
}
}
int[] sortDsc(int array[]) {
for (int i = 0; i < [Link]; i++) {
for (int j = 0; j < [Link] - 1; j++) {
if (array[j] < array[j + 1]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
[Link]("\nProses Pengurutan ke- " + (i + 1));
for (int k = 0; k < [Link]; k++) {
if (k < [Link])
[Link](array[k] + " ");
}
[Link]();
}
return array;
}
int getMax(int array[]) {
int max = array[0];
for (int i = 0; i < [Link]; i++) {
if (array[i] > max)
max = array[i];
}
return max;
}
}

You might also like