FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Python/insertsort.py at main · melophilecode/Python · GitHub
melophilecode
/
Python
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Python
/
insertsort.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
13 lines (13 loc) · 308 Bytes
Breadcrumbs
Python
/
insertsort.py
Copy path
File metadata and controls
13 lines (13 loc) · 308 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
def
insert
(
arr
):
for
i
in
range
(
len
(
arr
)):
tmp
=
arr
[
i
]
j
=
i
-
1
while
j
>=
0
and
tmp
<
arr
[
j
]:
arr
[
j
+
1
]
=
arr
[
j
]
j
=
j
-
1
arr
[
j
+
1
]
=
tmp
return
arr
arr
=
[
799
,
12
,
31
,
25
,
8
,
32
,
17
]
print
(
'Before Sorting:'
,
arr
)
ar
=
insert
(
arr
)
print
(
'After Sorting:'
,
ar
)
Back
|
FazBrowse Home
|
New Git URL