Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Slide 36 Please answer A-C Question 1 (30 POINTS): Given the input string WELOVEALGORITHMS, answer the following questions 1.A.) (15 POINTS) Usng the MergeSort algorithm

image text in transcribed

Slide 36

image text in transcribed

Please answer A-C

Question 1 (30 POINTS): Given the input string "WELOVEALGORITHMS", answer the following questions 1.A.) (15 POINTS) Usng the MergeSort algorithm provided in the course slides, ilustrate the operation of MergeSort to manually sort this strng Please show each step of your recursive soltion clearly. 1.B.) (10 POINTS) Using the Analysis of Merge Sort algorithm approach we studied in Chl starting with slide 36, perform a ruming time analysis ( only) of executing the MergeSort algorithm Please use your own words im the way you understood the algorithmic analysis. Use a generic " value for the imput size Hint: As the given imput is a string with an arbitrary listing of characters, ie. not necessarily in increasing or decreasing order, you should be considering average rumng IC) (5 POINTS) Usmg the size of the gren imput string , what will be the numeric value of the runming time? Please show your work

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Transact SQL Cookbook Help For Database Programmers

Authors: Ales Spetic, Jonathan Gennick

1st Edition

1565927567, 978-1565927568

More Books

Students also viewed these Databases questions

Question

What is the primary purpose of the statement of cash flows?

Answered: 1 week ago

Question

LO5 Describe job analysis and the stages in the process.

Answered: 1 week ago