Added PS Merge Sortconst int MAX SIZE = maxNmbrItemInArry;void merge (DataType theArray[),int first, int mid, int last)DataType tempArray(MAX_SIZE];int firstl = first;{int lastl= mid;int first2 = mid + 1;int last2last;%3DDiagram 9.3int index = firstl;for (; (firstl <= last1) && (first2 <= last2); ++index){if (theArray[firstl] < theArray[first2])tempArray (index] = theArray[firstl];{++firstl;else{tempArray(index)theArray (first2];++first2;OUTM3:06 / 3:38 Added PS Merge SortGiven an array of char named theArray with 8 elements.Draw the diagram that shows the detail process of sortingthe data in ascendng order using Mergesort technique.Added PSFill in the table below to show the changes in variablefirst 1, last 1, first 2, last 2, index and tempArray every timethe loops in merge() function is executed.Diagram 9.4[0][1][2][3][4][5][6][7]theArrayKMFtempArrayfirstllastlfirst2last2index(0][1][2][3][4][5][6][7]

Merge sort is a sorting technique which follows divide and conquer algorithm. It first divides the…

Given an array of char named theArray with 8 elements. Draw the diagram that shows the detail process of sorting the data in ascendng order using Mergesort technique. Added Fill in the table below to show the changes in variable first 1, last 1, first 2, last 2, index and tempArray every time the loops in merge() function is executed. Diagram 9.4 [0] [1] [2] [3] [4] [5] F [6] [7] theArray K M tempArray firstl lastl first2 last2 (0] (1] [2] [3] [4] [5] [6] [7] index

Given an array of char named theArray with 8 elements. Draw the diagram that shows the detail process of sorting the data in ascendng order using Mergesort technique. Added Fill in the table below to show the changes in variable first 1, last 1, first 2, last 2, index and tempArray every time the loops in merge() function is executed. Diagram 9.4 [0] [1] [2] [3] [4] [5] F [6] [7] theArray K M tempArray firstl lastl first2 last2 (0] (1] [2] [3] [4] [5] [6] [7] index

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assign letter grades O solutions submitted (max: 1) In the attached spreadsheet, you are given homework grades of 25 students. Sheet 1 (hw1) stores the first homework grades, Sheet 2 (hw2) is the second homework grades and so on. Use either xlsread() or readmatrix() to import the given data into Matlab. Once you have the data in Matlab; 1- Create separate arrays for each homework, name them as hw1, hw2, hw3, hw4, hw5 2- Create an average grade array named hwAvg. Store the average homework grade in hwAvg using the below weights Homework 1, 2: each 15% Homework 3, 4 : 20% Homework 5: 30% 3- Create an array named letterGrade to store letter grades, this will be an array of strings. • 4- Preallocate the letterGrade array. Make sure it has the same length as hwAvg array. 5- Assign letter grades from hwAvg array using the grading policy shown below 100 - 90 : A <90 - 80 : B <80 - 70:C <70 - 60 : D <60 :F It is recommended that you download the file, see what it looks like, figure the steps…
Describe the benefits of using the merge sort in Java. What are the key steps that must be taken to ensure an efficient sorting of objects? Also, specifically think of and give a real-life scenario where Merge sort may be used Merge sort may be a better fit than Quick and Radix sorts
a) Table 1 shows an array of ten registered participants of a concert organized by K-pop Entertainment company. Select a suitable category for you to implement a merge sort operation to answer the questions below. Table 1: List of registered participants of a concert. No Name Seat No Date of Birth Age Package 1 RAJA A1 11/12 21 1 ADLI C7 4/6 28 3 3 NARUTO B3 20/9 20 2 4 SARAH A2 9/9 27 5 AMEER D4 2/3 24 4 6 PRINCESS D8 2/12 25 7 IKHWAN C3 8/3 22 3 8 SIMON C9 3/3 18 3 9 AZIM Аб 2/2 20 1 10 RIZQEEN A9 7/4 24 2.
Please answers fast Implement an external sort, which uses intermediate files to sort files bigger than main memory. Why Mergesort is a better algorithm than heapsort or quicksort to base such an implementation on? Test your program both on files with small records and on files with large records.
ANSWER IN ONE NUMBER/WORD/SENTENCE 1.A sorted array contains 300,000 elements. The maximum number of operations needed by binary search to check if an element is present in the array would be 2.The correct statement indicating the recurrence relation for mergesort is Blank 1 302: T(n) = T(n/2) + n 303: T(n) = 2T(n/2) + n/2 304: T(n) = 2T(n/2) + n 306: T(n) = T(n – 1) + 3n 3.Put the most appropriate statement number here 171: Insertion at the end of an array structure takes O(1) time and insertion at the end of a linked list takes O(n) time. 172: Searching the largest element in a random array takes O(log n) 173: Deletion of first element takes O(1) for an array and O(1) for a linked list 174: Searching for mid element takes O(log n) both for a sorted array and a sorted linked list 4.An array contains following elements: 20 42 8 66 12 39 11 26 33 The mergesort method we discussed in the class calls a merge function. The number of times the merge function is going to be called…
PYTHON QUESTION This assignment requires you to create a dictionary by reading the text file created for the Chapter 6 assignment. The dictionary should have player names for the keys. The value for each key must be a two-element list holding the player's goals and assists, respectively. See page 472! Start with an empty dictionary. Then, use a loop to cycle through the text file and add key-value pairs to the dictionary. Close the text file and process the dictionary to print the stats and determine the top scorer as before. In fact, much of the code used in program6_2.py can be copied and used for this program. Printing the stats for each player is the most challenging part of this program. To master this, refer to the examples in the zip file that can be downloaded from the "Dictionary values can be lists" link in the "Learn Here" part of this module. NOTE: you do not need to submit the text file. Submit just this program. The required output should be the same well-formatted table…
Write the following function that partitions the list using the first element, called a pivot:def partition(lst): After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition.
Put the records into a nested list - Each individual record consists of 3 pieces of information, each coming from one of the 3 consecutive lines in the text file. - Each record is a 3-element lists and all records would themselves be list elements, i.e. you would have a (nested) list of lists holding all your data: arecord = [ <id>, <date>, <title>] records_list = [ <first record>, <second record>, …, <last record> ] - you will need to use a loop here.
numbers: 13 18 72 26 62 74 Merge(numbers, 0, 2, 5) is called. Complete the table for leftPos and rightPos at the moment an element is copied into merged Numbers. mergePos leftPos rightPos 0 1 2 3 4 LO 5 0 Ex: 3 ŵ î î 3 ŵ Element copied to merged Numbers 13 18 26 62 72 74
4- Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 102, 112, 1} a) Using Merge Sort and show the order that the Merge procedure is performed. b) Explain the average case of Merge Sort. Give a detail explanation of how we can estimate the mean in relationship with the worst and best-case scenarios (hint: use the answer for question 3 as a lower-bound for the average).
Create a merge solution based on the following concept that lowers the additional space needed to max(M, N/M): Divide the array into N/M chunks of size M (for the sake of ease, suppose N is a multiple of M). Then, (i) sort the blocks as items with their first key as the sort key, and (ii) cycle through the array combining the first block with the second, then the second block with the third, and so on.
Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient. b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure. c. A dynamically resizable array is another name for a linked list. d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand. e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an array