Closed Juro221 closed 9 months ago
We compute the position where arr[i] should be placed and if it is already taken we look at the next position. Time complexity : O(n)
This PR has not been updated for a while, closing it. Thanks!
We compute the position where arr[i] should be placed and if it is already taken we look at the next position. Time complexity : O(n)