Algorithms | InsertionSort | Question 5
The auxiliary space of insertion sort is O(1), what does O(1) mean ?
(A) The memory (space) required to process the data is not constant.
(B) It means the amount of extra memory Insertion Sort consumes doesn’t depend on the input. The algorithm should use the same amount of memory for all inputs.
(C) It takes only 1 kb of memory .
(D) It is the speed at which the elements are traversed.
Explanation: The term O(1) states that the space required by the insertion sort is constant i.e., space required doesn’t depend on input.
Quiz of this Question