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 c…

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 c…
asked 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

asked
User Bilbohhh
by
7.7k points

1 Answer

4 votes

Answer:

B. because it is performed in place

Step-by-step explanation:

For the PLATO test

answered
User Stephane Gosselin
by
7.7k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

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.
Seven basic internal components found in a computer tower
Link Copied!