Insertion Sort Spatial Complexity #52
Description
What about spatial complexity? O(1)! We don't create any additional items for this sort.
The proposed solution creates a variable, let numberToInsert = nums[i] inside the outer for loop. Wouldn't that mean the spatial complexity is O(n)?