COMPUTER ORGANIZATION+DESIGN >I<
COMPUTER ORGANIZATION+DESIGN >I<
5th Edition
ISBN: 9781541868397
Author: Patterson
Publisher: ZYBOOKS (CC)
Question
Book Icon
Chapter 6, Problem 6.5.1E
Program Plan Intro

Parallelism:

The state of being parallel and having correspondence among them is referred as parallelism. Two or more tasks can be performed simultaneously, without affecting the performance of the either one.

Given Information:

It is given that for the following recursive merge sort algorithm, the basic idea is to divide an unsorted list x of m elements into two sub lists of about half the size of the original list.

The merge sort is carried out by the following code:

//Merge soft algorithm where m is the array passed as parameter

Mergesort(m)

//define variable left, right and result

var list left, right, result

//check if length of the array is less than "1"

if length(m) ≤ 1

//if length of array is less than "1" then return

return m

else

// set length of array as middle variable

var middle = length(m)/2

for each x in m after middle

//add the integer value to the left

add x to left

for each x in m after middle

//add the itneger value to the right

add x to right

//Sort the left array

left = Mergesort(left)

//Sort the right array

right = Mergesort(right)

//merge the sorted left and right array

result = Merge(left, right)

return result

The merge step is mentioned below:

//merge the left and right sorted array

Merge(left, right)

//declare variable result

var list result

//While loop continues till elements exist in array

while length(left) >0 and length(right) > 0

/* check if first value of left array is less than first value of right array */

if first(left) ≤ first(right)

//add first of left array to the result //array

append first(left) to result

left = rest(left)

else

//add first of right array to the result //array

append first(right) to result

right = rest(right)

//check if length of left array is greater than 0

if length(left) >0

//add rest of left array to the result array

append rest(left) to result

if length(right) >0

//add rest of right array to the result array

append rest(right) to result

//return result array

return result

Blurred answer
Students have asked these similar questions
You have database for EDMDB that contains two table as describing below: tbUser: create table tbUser (UserID int primary key auto_increment, UserName varchar(100) not null, password varchar(20), level int default 3, regDate date); UserID(P.K.) UserName 1 Ali 2 Sara 3 Jasim Password Level 1234 1 regDate 1-10-2018 1234 2 1-11-2018 1234 1 15-11-2018 Q1-Create TbDoc as describe above. Q2: insert the data in to the table as a variable data? Q3: delete user who name is Jasim. Q4: update to change each values of Password from 1234 to 4321? Q5: delete each record from tbUser when Level is 2? Good Luck!
محولة من جُومَانَا ) Design and draw a circuit using a decoder to select four memory devices 27256 starting at memory location 40000H and three memory devices 62256 starting at memory location A0000H. Hint: additional information needed you will find in the datasheet. ممكن الحل 4:57 ✓
Information Technology department You have database EDMS DB contains the documents table as describing below: CREATE TABLE doc_tb (doc_id int PRIMARY KEY AUTO_INCREMENT, doc_no int,doc_date date, title varchar(100), direction int, person varchar(100), notes varchar(100)); direction doc_id 1 doc_no 234 doc_no 2022-5-1 Title Add serves 4 2 5484 3 36 2022-5-9 2022-5-14 Move employ to Basra Thanks for all employee 12 person Ali Hameed Sara Hasan Notes 1 Null Q1: insert all the data above using parameter. Q2: Update the table by adding notes word '#' for each person have words 'Ha'. Q3: Update the table by adding notes word '*' when the document not refereeing for any person. 4: delete each record from the table when the value of notes contains '*'; Good Luck!
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY