andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

improve scripts

Browse Source
This commit is contained in:
Rohit Tanwar
2018-02-22 09:35:43 +05:30
parent 8b4f245d2a
commit 0ca01ec1bf
5 changed files with 4 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -233,7 +233,7 @@ difference_by([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], lambda v : v['x']) # [ { x
On a very basic level, an insertion sort algorithm contains the logic of shifting around and inserting elements in order to sort an unordered list of any size. The way that it goes about inserting elements, however, is what makes insertion sort so very interesting!
```py
def insertionsort(arr):
def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]

1
tag_database
View File

@ -23,4 +23,3 @@ is_lower_case:string
count_by:list
difference_by:list
insertion_sort:list

1
test/average/average.test.py
View File

@ -3,4 +3,5 @@ from pytape import test
from average import average
def average_test(t):
t.true(isinstance(average, (types.BuiltinFunctionType, types.FunctionType, functools.partial)),'average is a function')
t.equal(2,2,'equal')
test('Testing average',average_test)

2
test/insertion_sort/insertion_sort.py
View File

@ -1,4 +1,4 @@
def insertionsort(arr):
def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]

10
website/index.html
View File

@ -1,10 +0,0 @@
<html>
<head>
<link href="prism.css" rel = "stylesheet"></link>
</head>
<script src="prism.js"></script>
<pre><code class="language-python">def Hello_World(val):
print(f&#39;Hello {val}&#39;)
wow!
</code></pre>
</html>