public class Solution {

    public double findMedian(int[] numbers) {

        int[] copy = Arrays.copyOf(numbers, numbers.length);
        Arrays.sort(copy);

        int n = copy.length;
        int mid = n / 2;


        if (n % 2 == 1) {
            return copy[mid];
        }

        return (copy[mid - 1] + copy[mid]) / 2.0;
    }
}