For tracing binary search algorithm, use list={11,15,2,4,1} and key=4 for selection sort. A table with four columns (low, high, mid, and call) should be used.

i just need answer not process  please quickly thanks !

QUESTION 22 Evaluating Sorts Given the following array: 4, 6, 1, 7, 8, 0 Show what the array looks like after the 2rd swap of a Selection Sort in ascending order.

How should I insert nodes into a data structure so that insertion, deletion, and searching take less than O(n) time?

Overview This is a review assignment where you will use multiple tools you have picked up so far throughout the course. If you're confused about how to do something make sure you look back at earlier assignments. In this program you will start by declaring an empty dictionary named population_dict. Then you will use a while-loop to prompt a user for a series of cities and their populations, storing the input in population_dict). After this you will prompt the user to decide what is the maximum population for a city to be considers a small down. Finally, you will open a file called populationdata.txt where you will write the results. Expected Output Example of standard out (the console): What is next city? (enter q to quit) Long Beach What is the population of Long Beach? 362000 What is next city? (enter q to quit) Los Angeles What is the population of Los Angeles? 382000000 What is next city? (enter q to quit) San Diego What is the population of San Diego? 136000000 What is next city?…