Register
Why is the insertion sort algorithm useful when you need to conserve memory? A. because it is fast B. because it is performed in place C. because it is efficient D. because it creates a temporary array
61.3k views
4 votes
Why is the insertion sort algorithm useful when you need to conserve memory?

A. because it is fast
B. because it is performed in place
C. because it is efficient
D. because it creates a temporary array and destroys it quickly

User Bilbohhh
by
7.3k points

1 Answer

4 votes

Answer:

B. because it is performed in place

Step-by-step explanation:

For the PLATO test

User Stephane Gosselin
by
7.3k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

8.8m questions

11.4m answers

Other Questions

“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Please help me ! All you do is just put it it all in your own words ! Please this is for my reported card!i don't know how to put it in my own words because my English is not that good!
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Disadvantages of using animation in advertising? advantages and disadvantages of using animation for education? advantages and disadvantages of using animation in entertainment?
Link Copied!