Implement a method that finds the median of an array. Use the numbers provided in files

(100.txt, 1000.txt, 5000.txt, 50000.txt, 100000.txt and 500000.txt) as input. Your method

should use the partitioning method (the one used in quicksort).

Complete in python and show screenshots of code and output. I will only supply 100.txt because the other txt files would be too much.

100.txt

4 50 34 40 22 54 94 3 94 38 8 95 0 36 54 54 81 30 24 98 12 25 43 0 52 52

88 22 83 70 96 57 89 53 13 64 74 18 37 86 73 76 15 1 93 69 77 81 29 78 14

45 67 1 0 41 60 63 74 16 75 75 36 49 68 5 67 29 15 84 47 77 40 80 24 61 25

7 85 83 81 47 10 39 22 72 87 64 92 27 50 69 12 54 23 85 38 75 73 94