Java programming Problem-2 Among Quicksort, Selection sort, Insertion sort and Heap sorts which one needs the minimum number of swaps?

PYTHON PROGRAMMING ONLY PLZ( USING STACKS AND QUEUES)(DO NOT JUST PRINT THE RAW LIST MUST BE IN A STACK) my code and an example of a stack will be below just need help a little confused. Write a small program that simulates a doctor's Office. Your office will perform the following tasks Keep track of the waiting list using a queue  Keep track of what checks need to happen to each person in a stack (check temperature, check weight, etc..).   Your program will Ask the patient for their name. (you will store this data in a queue) (You must have at least 4 names in your queue before calling them to the doctor) Ask the customers what brings them in today   Display to the console You will show your patients being called to the doctor and the queue changing.  Describe your queue do not just print the raw list You will show the doctor administering the checks in the stack and your stack being updated. Describe your stack do not just print the raw stack How you create the doctor's…

Write a C++ program to take N elements and do the following:   a. Insert them into a heap one by one b. Build a heap in linear time. Compare the running time of both algorithms for sorted,reverse-ordered, and random inputs   C++ Language Only Please Be thorough in comments for explanation (I tried a class and void functions I got stuck in my code it would be awesome if you utilize that for me)   Thank You

Write a program in C++ using a heap sort and test it with the following data. You need to give the program and show the result. 11, 25, 5, 14, 7, 78, 44, 44

java