What is an in-place sorting algorithm?

A、It needs O(1) or O(logn) memory to create auxiliary locations;

B、The input is already sorted and in-place;

C、It requires additional storage;

D、It requires additional space