How this special computer can be used to sort the given n

Assignment Help Computer Engineering

Reference no: EM132141249

Question :

Suppose you are given n positive integers to sort on a special computer which has access to special memory containing p slots.

The special memory supports storing a key-value pair (a, b) into the memory in O(1) time (assuming there is space) and extracting (that is, remove and return) the pair (a, b) with smallest a in O(1) time.

Write an algorithm to show how this special computer can be used to sort the given n integers. Is your algorithm better than insertion sort? How about Merge Sort?

Reference no: EM132141249

Questions Cloud

Describe the ways in which this is an example of attacks : Suppose you are doing some online banking using your bank's website. An attacker has set up an active wiretap between your computer and your bank's server.

Forecasted an expected return : Using the data from problem 1, if you forecasted an expected return of 16.00% for stock XYZ, is it overvalued, undervalued, or fairly valued? Briefly, why?

Compare the time for a query and response for a complete : Compare the time for a query and response for a complete DNS query and response (to all required nameservers) if M=1, M=2, and M=3.

How much will it cost to provide disk space : At contemporary memory pricing of $7 / GB, how much will it cost to fill the machine? Knowing what you know about virtual memory.

How this special computer can be used to sort the given n : Suppose you are given n positive integers to sort on a special computer which has access to special memory containing p slots.

Create an algorithm for telling if l and m store the same : Create an algorithm for telling if L and M store the same sequence of elements (but perhaps with different starting points).

Provide again a polynomial time algorithm : Suppose we are given a directed graph G = (V, E), a set of nodes A V (denoted as people) and a set of nodes B V (denoted as exit).

What is the running time of your algorithm : Give a bottom-up dynamic programming algorithm based off your recursive definition. What is the running time of your algorithm?

How many total packets are sent with stop-and-wait : Assume that ACKs are never lost. How many total packets (including retransmissions) are sent with stop-and-wait.

User Account

All Pages