Ask question

Ask question

All categories

3 years ago

5

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

Computers and Technology

1 answer:

Arte-miy333 [17]3 years ago

8 0

I’m guessing that what’s being looked at here moreso is the space complexity of these algorithms. Heap sort and insertion sort I believe have the lowest of these, but insertion sort is also known to not be the best with time complexity. Therefore heap sort should take the cake

You might be interested in

Use the variables k and total to write a while loop that computes the sum of the squares of the first 50 counting numbers, and a

pshichka [43]

Int k=0.total=0;
while(k++<50)
total+=k*k;

5 0

3 years ago

My dog peed in the house last week

Solnce55 [7]

Answer:

my dog chewed up the couch

Explanation:

5 0

3 years ago

Read 2 more answers

The manufacturer doesn't need it the buyer doesn't want it the user doesn't know they're using it

Vikentia [17]

That means that the production vause a loss in supply and demand

6 0

3 years ago

Identify the operation which is NOT one of the parts of the fivebasic set operations in relational algebra?

wariber [46]

Answer:

Join

Explanation:

Five basic set operators in relational algebra are as follows:

Selection - tuple selection
Projection - extract columns
Cartesian product - cross product of relations
Set union - union of two relations
Set difference - minus operation on two relations

As we can see, Join is not part of the basic set operations but it is implemented using the Cartesian Product operator.

5 0

2 years ago

Providing incentives for customers to learn more about your service is known as?

Julli [10]

B) Advertising is the answer

3 0

3 years ago