You say:
As quicksort doesn’t use any space, it’s a in-place sorting algorithm .
But the worst complexity space is O(log(n))
I am puzzled by the concept of no space. All the elements will have to be in an array first and foremost.
Can you please explain how “no space” works? Thanks!
Course: Mastering Data Structures and Sorting Algorithms in JavaScript - Learn Interactively
Lesson: Introduction to Quicksort - Mastering Data Structures and Sorting Algorithms in JavaScript