It is a written project, you just need to submit a text file in txt, or docx or pfd format and don't have to submit your testing codes.For the following array x [10] = { 45, 20, 50, 30, 80, 10, 60, 70, 40, 90}show the contents of x after the function call split Pos = split(x, 0, 9) is executed, and give the value of the array index splitPos (the first is the pivot). Modify quicksort() to incorporate this modification: In quicksort, we do not splitting sublists further when they have fewer than LOWER_BOUND elements for some constant LOWER_BOUND. When execution of the quicksort algorithm terminates, simply sort the whole list using insertion sort. Include the modified code in this document Use the similar diagram as for merge-sorting the following list of numbers : 8, 2, 9, 4, 5, 3, 1, 6Upload your solutions in a document file. ### Merge Sort Algorithm VisualizationThe image illustrates the step-by-step process of the Merge Sort algorithm, which is a divide-and-conquer sorting algorithm. The diagram breaks down the given unsorted array into smaller parts and then merges them back together in a sorted order.#### Step-by-Step Breakdown:1. **Initial Array:** ``` [4, 2, 9, 7, 8, 5, 1, 3] ``` 2. **Divide Phase:** - The initial array is divided into two halves: ``` [4, 2, 9, 7] and [8, 5, 1, 3] ``` - Each half is recursively divided further into smaller subarrays: ``` [4, 2] and [9, 7] from [4, 2, 9, 7] [8, 5] and [1, 3] from [8, 5, 1, 3] ``` - Continue dividing until each subarray contains only one element: ``` [4], [2], [9], [7], [8], [5], [1], [3] ```3. **Merge Phase:** - Now, start merging the subarrays back together in sorted order: - Merge [4] and [2]: ``` [2, 4] ``` - Merge [9] and [7]: ``` [7, 9] ``` - Merge [8] and [5]: ``` [5, 8] ``` - Merge [1] and [3]: ``` [1, 3] ``` - Merge the newly formed sorted subarrays: - Merge [2, 4] and [7, 9]: ``` [2, 4, 7, 9] ``` - Merge [5, 8] and [1, 3]: ``` [1, 3, 5, 8] ``` - Finally, merge the two large sorted subarrays: - Merge [2, 4, 7, 9] and [1, 3, 5, 8]: ``` [1, 2, 3, 4,

Contents of x after split(x,0,9) is executed is 45 20 50 30 80 10 60 70 40 90 Value of array index…

Answered: It is a written project, you just need…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

It is a written project, you just need to submit a text file in txt, or docx or pfd format and don't have to submit your testing codes.

For the following array x [10] = { 45, 20, 50, 30, 80, 10, 60, 70, 40, 90}
show the contents of x after the function call split Pos = split(x, 0, 9) is executed, and give the value of the array index splitPos (the first is the pivot).
Modify quicksort() to incorporate this modification: In quicksort, we do not splitting sublists further when they have fewer than LOWER_BOUND elements for some constant LOWER_BOUND. When execution of the quicksort algorithm terminates, simply sort the whole list using insertion sort. Include the modified code in this document
Use the similar diagram as

for merge-sorting the following list of numbers :

8, 2, 9, 4, 5, 3, 1, 6

Upload your solutions in a document file.