Question: Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must

Suppose we have two computers, computer A, a fast computer running insertion sort. Computer B, a slow computer running merge sort. Each must sort an array of 100 million numbers. Suppose that computer A executes 100 billion instructions per second and computer B executes 100 million instructions per second. Suppose Computer A requires 5!instructions to sort n numbers and computer B requires 100 instructions to sort the n numbers. Find the time it takes the two computers to sort the 100 million numbers?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Suppose we have two computers, computer A , a fast computer running insertion sort. Computer B , a slow computer running merge sort. Each must sort an array of 1 0 0 million numbers. Suppose that...

Q:

Programming Assignment 3 COP3502 Computer Science I Summer 2022 Overview This assignment is intended to make you implement several different sorting algorithms, and the means to analyze their...

Q:

Determine which computer will process the data below faster. Computer A running insertion sort against a slower computer B running merge sort. They each must sort an array of 50 million numbers....

Q:

CSC c++ code needed, please help. Analysis of Algorithms Computer Science. You need to implement insertion sort and merge sort (decreasing or increasing order) algorithms and measure the performance...

Q:

This is for C Programming Data Structures & Algorithm: I need help with the following assignment. How is the best way to approach each function? If you can help with either code or pseudo code in...

Q:

Express this current, i(t)=5.cos(10-t+30 deg)+5.sin(10-t-50 deg) in the general form i(t)=1,-cos(w-t+o) Represent this expression in polar and rectangular form (50/30)(3724) (5+17) +(3-j7) Find the...

Q:

A new loan was taken out during July 2 0 2 4 with the first instalment of R 7 8 0 0 due on the 3 1 December 2 0 2 4 . how do we record this when calculating deferred tax

Q:

1) Given the following information: Spot rate today of Swiss franc = $0.62 1-year forward rate as of today for Swiss franc = $0.65 Rate on 1-year deposits denominated in Swiss francs = 9% Rate on...

Q:

4. What are the challenges posed by strategic information systems and how should they be addressed?

Q:

3. How do Porters competitive forces model, the value chain model, synergies, core competencies, and network economics help companies develop competitive strategies using information systems?

Q:

1. How is software adding value to automakers products? As the smartphone market continues to expand, another industry has begun getting smarter with software and apps: the automobile industry. Ford,...