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