• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Algorithms | InsertionSort | Question 5

The auxiliary space of insertion sort is O(1), what does O(1) mean?


The memory (space) required to process the data is not constant.


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.


It takes only 1 kb of memory.


It is the speed at which the elements are traversed.


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments