??is there is a way to implement the heap data structure and using the quicksort algorithms to find the median?

i want the code in python please

Design data structures: present five data structures including B-tree for big data (you find data), for sorting algorithms. In this project, you will implement and analyze the following. - Median finding, Order Statistics, and Quick Sort: In this project, you will implement the median-finding algorithms. The user should be able to select the " k ", i.e., the rank of the number desired as output (k=n/2 is the median ). You should also be able to select groups of 3,5,7, etc. in the linear-time median finding algorithm and be able to compare the performance of each. Also, implement the randomized median finding algorithm and compare it against the linear-time one. Implement quick sorting using both algorithms and compare the performances of these different versions