Answer:
//Given variables, 
int [ ] x = array of integer elements 
int n = x.length // number of elements in array x 
int m //not set yet 
//Custom variable(s) 
int [ ] sortedx = sorted form of array x 
double medianpos = hold the median position 
 
//Find if n is odd or even 
if (n % 2 == 0){ //if the modulus of n by 2 gives zero(0) 
 n is even 
 medianpos = n/2 
 m = (sortedx [medianpos -1] + sortedx [medianpos] ) / 2 
} 
else{ 
 n is odd 
 medianpos = (n+1) / 2 // add 1 to n and divide the result by 2 
 m = sortedx [medianpos - 1] // since arrays are indexed from zero(0) 
} 
Step-by-step explanation:
Explanations are written as comments in the answer.
Hope it helps!