Created
October 11, 2024 16:24
-
-
Save wanantope/8c621bb06401e6dfd7e8a97441031752 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class Main { | |
| public static void main(String[] args) { | |
| //делаем первый массив и создаем второй на основе макс. числа из первого | |
| int[] Java = {9, 8, 9, 3}; | |
| System.out.print("Массив Java в начале: "); | |
| for (int i = 0; i < Java.length; i++) { | |
| System.out.print(Java[i] + ","); | |
| } | |
| System.out.println(); | |
| int max = Java[0]; | |
| for (int i = 0; i < Java.length; i++) { | |
| if(Java[i] > max){ | |
| max = Java[i]; | |
| } | |
| } | |
| int[] mas = new int[max + 1]; | |
| //сложная фурмолировка ну там с подстановкой что то | |
| System.out.print("Второй массив mas:"); | |
| for (int num : Java) { | |
| mas[num]++; | |
| } | |
| for (int i = 0; i < mas.length; i++) { | |
| System.out.print(mas[i] + ","); | |
| } | |
| //сортировка первого массива | |
| boolean isSorted = false; | |
| int temp; | |
| int offset = 0; | |
| do { | |
| isSorted = true; | |
| for (int i = 0; i < Java.length - 1 - offset; i++) { | |
| if (Java[i+1] < Java[i]) { | |
| temp = Java[i]; | |
| Java[i] = Java[i+1]; | |
| Java[i+1] = temp; | |
| isSorted = false; | |
| } | |
| } | |
| offset++; | |
| } while(isSorted == false); | |
| System.out.println(); | |
| System.out.print("Массив Java в конце:"); | |
| for (int i = 0; i < Java.length; i++) { | |
| System.out.print(Java[i] + ","); | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment