MCPcopy Create free account
hub / github.com/BeeBombshell/Python-DSA / Solution

Class Solution

Sort-all/insertion.py:2–10  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1
2class Solution:
3 def sortArray(self, N: List[int]) -> List[int]:
4 L = len(N)
5 for i in range(1,L):
6 for j in range(0,i):
7 if N[i] < N[j]:
8 N.insert(j, N.pop(i))
9 break
10 return N

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected