Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Shavit Borisov
- // CW
- import java.util.Random;
- public class Main {
- public static void main(String[] args)
- {
- final int SIZE = 10;
- int[] arr = new int[SIZE];
- getIni(arr);
- System.out.printf("Array arr before sort:\n");
- printArr(arr);
- int min;
- for(int i = 0; i < arr.length - 1; i++)
- {
- min = searchMin(arr, i);
- if(min != i)
- swap(arr, i, min);
- }
- System.out.printf("Array arr after sort:\n");
- printArr(arr);
- }
- private static void getIni(int[] arr)
- {
- Random r = new Random();
- for(int i = 0; i < arr.length; i++)
- arr[i] = r.nextInt(100) + 1;
- }
- private static int searchMin(int[] arr, int i)
- {
- int min = i;
- for(int j = i + 1; j < arr.length; j++)
- if(arr[j] < arr[min])
- min = j;
- return min;
- }
- private static void swap(int[] arr, int index, int min)
- {
- int temp = arr[min];
- arr[min] = arr[index];
- arr[index] = temp;
- }
- private static void printArr(int[] arr)
- {
- for(int i = 1; i <= arr.length; i++)
- {
- System.out.printf("arr[%d] = %d\t", i - 1, arr[i - 1]);
- if(i % 5 == 0)
- System.out.printf("\n");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement