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

My account
Edit my Profile
Private messages
My favorites

Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question

asked Dec 11, 2022 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

Computers and Technology
college

Bilbohhh asked

by Bilbohhh

4.8k points

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

4 votes

Answer:

B. because it is performed in place

Step-by-step explanation:

For the PLATO test

Stephane Gosselin answered Dec 16, 2022

by Stephane Gosselin

4.9k points

0 Comments

Please log in or register to add a comment.

Ask a Question

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

5.6m questions

7.3m answers

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 Comments

Please log in or register to add a comment.

Other Questions