public static int findMedian(List<Integer> arr) {
    // Write your code here
        Collections.sort(arr);
        return arr.get(((0 + arr.size() - 1) / 2));
    }

function findMedian(arr) {
    arr.sort(function(a,b){return a-b})
    return arr[(arr.length/2).toFixed(0)-1]
}

function findMedian($arr) {
    sorting($arr);
    $mid = count($arr) / 2;

    return $arr[$mid];
}

function sorting(&$arr) {
    if (empty($arr)) {
        return;
    }
    
    $left = [];
    $right = [];
    $first = $arr[0];
    for ($i = 1; $i < count($arr); $i++) {
        if ($arr[$i] < $first) {
            $left[] = $arr[$i];
        } else {
            $right[] = $arr[$i];
        }
    }
    
    sorting($left);
    sorting($right);
    
    $arr = array_merge($left, [$first], $right);
}

function findMedian(arr: number[]): number {
    // Write your code here
    var arrSize = arr.length;
    // sort number array ascending
    let sortedArray = arr.sort((a,b) => {return a-b});
    // if arrSize is even return average of two else return the middle
    return arrSize % 2 == 0 ? (sortedArray[arrSize/2] + arr[(arrSize/2)-1])/2 : sortedArray[(arrSize-1)/2]
		}