(a)If all the elements in an input array of size 𝑁 are identical, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input.

Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort

(b) If the elements in an input array of size 𝑁 are sorted in reverse order, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input.

Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort

(c)If the elements in an input array of size 𝑁 are already sorted in the correct order, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input. Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort

(a)Construct an array of 25 elements containing the numbers 1 through 25 for which Shell Sort, with h-values {13, 4, 1} would use many compares than usual. In other words, construct an

array that would result in a worst-case runtime. How many compares does it require to be sorted?

HINT: Although you can search for a sequence of 25 values that causes the largest amount of compares, you will have to dedicate a daunting amount of time on doing that. Instead, search for a β€œbad” sequence going backwards: for β„Ž = 1, place the 25 values such that the algorithm must swap the values a lot of times. Repeat the process for β„Ž = 4 and β„Ž = 13.

(b) Describe the best-case runtime for Shell Sort and the kind of input that would result in the best-case runtime. Justify your answer.

(a)Show the following array as it goes through in-place Heap Sort (from smallest to largest).

{3, 4, 1, 0, 9, 2}

(b) Explain in detail the worst-case runtime of Heap Sort. Your explanation should include a summation.

(c)What is the best-case runtime for Heap Sort? Be specific about the input that would result in the best case and explain your reasoning.

For this Discussion, imagine that you are a researcher proposing a project that involves the use of live human research subjects.

Step 1: Your Initial Post β€“ Explain your project (it doesn’t have to be something that is actually currently being researched – you can choose a historical example or something science fiction-y). What are you hoping to discover through this research? Why do you need to use live humans for this research? What population will you tap for subjects (why that population in particular)? What are the potential risks this project poses to the research subjects? What safeguards will you take to protect your subjects from these risks?

Identify and classify (say what kind) the nouns in the following sentences.

1. Three doctors work in this hospital.

2. There is a man and a woman in that picture.

3. Open your books and read the words on the first page.

4. Everybody wants peace and not war.

5. I took his advice and sent the parcels addressed to Mary Gomes to the post office.

What balance do online sellers use in brand marketing relative to advertising (paid media), public relations (earned media), or social media (owned media)? Share some examples.

What balance do online sellers use in brand marketing relative to advertising (paid media), public relations (earned media), or social media (owned media)? Share some examples.

How do you think online shopping has attained its dominant seller position? How did it attain its position in your shopping life?

How do you think online shopping has attained its dominant seller position? How did it attain its position in your shopping life?

How do you think online shopping has attained its dominant seller position? How did it attain its position in your shopping life?

How do you think online shopping has attained its dominant seller position? How did it attain its position in your shopping life?

× How can I help you?