Question

Develop an algorithm in pseudocode to find the median value in a list containing N unique numbers. The median of N numbers is defined as the value in the list in which approximately half the values are larger than it and half the values are smaller than it. For example, consider the following list of seven numbers.  26, 50, 83, 44, 91, 20, 55 The median value is 50 because three values (20, 26, and 44) are smaller and three values (55, 83, and 91) are larger. If N is an even value, then the number of values larger than the median will be one greater than the number of values smaller than the median.

Answer 1

Algorithm for find the median value of list containing N unique numbers.

Step 1: START
Step 2: declare and define the value of N (Size of the list)
Step 3: declare List of size N
Step 4: Assign N values in the List.
Step 5: Sort the List
Step 6: If N is Odd, Goto Step 7
Else Goto Step 8
Step 7: Assign (N+1/2)th element of a list as Median.
Step 8: Assign (N/2)th element of a list as Median.
Step 9: Print Median
Step 10: STOP.

#Python Code to demonstrate the median finding in the list:-

def main():
list1=[26,50,83,44,91,20,55]
list1.sort()
n=len(list1)
if n%2==0:
t=int((n-1)/2)
median=list1[t]
else:
t=int(n/2)
median=list1[t]
print("Median : ",median)
  
if __name__=="__main__":
main()
  
  

main.py 1. def main(): 2 list1=[26,50,83,44,91,20,55] 3 listi.sort() 4 n=len(list) 5 if n%2==0: 6 trint((n-1)/2) 7 median=list1[t] else: 9 t=int(n/2) 10 median=list1[t] 11 print("Median : ", median) 12 13- if main 14 main() 8 name input Median : 50 ..Program finished with exit code 0 Press ENTER to exit console.

Note:- In algorithm and program, there is a difference in indexing . In algorithm indexing starts with 1 but in program indexing starts with 0.