@@ -0,0 +1,1174 @@
+package com.javarush.task.task12.task1233;%0A%0A/* %0A%D0%98%D0%B7%D0%BE%D0%BC%D0%BE%D1%80%D1%84%D1%8B %D0%BD%D0%B0%D1%81%D1%82%D1%83%D0%BF%D0%B0%D1%8E%D1%82%0A*/%0A%0Aimport java.util.Arrays;%0A%0Apublic class Solution %7B%0A    public static void main(String%5B%5D args) throws Exception %7B%0A        int%5B%5D data = new int%5B%5D%7B1, 2, 3, 5, -2, -8, 0, 77, 5, 5%7D;%0A%0A        Pair%3CInteger, Integer%3E result = getMinimumAndIndex(data);%0A%0A        System.out.println(%22Minimum is %22 + result.x);%0A        System.out.println(%22Index of minimum element is %22 + result.y);%0A    %7D%0A%0A    public static Pair%3CInteger, Integer%3E getMinimumAndIndex(int%5B%5D array) %7B%0A        if (array == null %7C%7C array.length == 0) %7B%0A            return new Pair%3CInteger, Integer%3E(null, null);%0A        %7D%0A%0A        //%D0%BD%D0%B0%D0%BF%D0%B8%D1%88%D0%B8%D1%82%D0%B5 %D1%82%D1%83%D1%82 %D0%B2%D0%B0%D1%88 %D0%BA%D0%BE%D0%B4%0A        int%5B%5D arrayCopy = array.clone();%0A        Arrays.sort(arrayCopy);%0A%0A        Pair%3CInteger, Integer%3E pair = new Pair%3C%3E(0, 0);%0A        for (int i = 0; i %3C array.length; i++) %7B%0A            if (array%5Bi%5D == arrayCopy%5B0%5D) %7B%0A                pair = new Pair%3C%3E(array%5Bi%5D, i);%0A            %7D%0A        %7D%0A        return pair;%0A    %7D%0A%0A%0A    public static class Pair%3CX, Y%3E %7B%0A        public X x;%0A        public Y y;%0A%0A        public Pair(X x, Y y) %7B%0A            this.x = x;%0A            this.y = y;%0A        %7D%0A    %7D%0A%7D%0A

Complete task1233