submission_id
int32 10
42.5k
| func_code
stringlengths 22
782
| assignment_id
stringlengths 4
23
| func_name
stringlengths 4
23
| description
stringlengths 26
128
| test
stringlengths 45
1.22k
| correct
bool 2
classes | user
stringlengths 36
36
| academic_year
int32 2.02k
2.02k
|
|---|---|---|---|---|---|---|---|---|
18,554 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
32,573 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
35,980 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
24,013 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
j = 0
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
1,226 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
21,950 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
25,733 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
19,319 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, j, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
1,808 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
17,087 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
18,100 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
38,298 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a
| 2,016 |
36,172 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a
| 2,016 |
30,616 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a
| 2,016 |
11,827 |
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
7d0d82bd-2bdb-48da-a37f-ffa6ee59d960
| 2,016 |
17,059 |
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
7d0d82bd-2bdb-48da-a37f-ffa6ee59d960
| 2,016 |
3,774 |
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
7d0d82bd-2bdb-48da-a37f-ffa6ee59d960
| 2,016 |
11,264 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
27,915 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
i = 0
while i < len(a):
j = i + 1
find_position - of - smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
8,146 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
34,828 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
j = i + 1
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
1,154 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
while i < len(a):
p = find_first_position_of_smallest(a, i)
swap(a, j, i)
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
29,688 |
def find_position_of_smallest(a, i):
x = i
while i < len(a):
if a[i] < a[x]:
x = i
i = i + 1
return x
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
3aed57e0-c2a2-49b2-afaf-23d3d77478fb
| 2,016 |
35,235 |
def find_position_of_smallest(a, i):
x = i
while i < len(a):
if a[i] < a[x]:
x = i
i = i + 1
return x
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
3aed57e0-c2a2-49b2-afaf-23d3d77478fb
| 2,016 |
27,109 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
p = i
find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
9,848 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
6aa0e790-273f-4239-98eb-0b504997b70b
| 2,016 |
21,806 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
edfafe89-fb39-4804-a616-a60af6a9fb7e
| 2,016 |
17,273 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
edfafe89-fb39-4804-a616-a60af6a9fb7e
| 2,016 |
26,343 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
edfafe89-fb39-4804-a616-a60af6a9fb7e
| 2,016 |
31,507 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
6aa0e790-273f-4239-98eb-0b504997b70b
| 2,016 |
22,429 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
24,153 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
30,913 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
37,373 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
33,559 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
p = i
find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
26,033 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
41,464 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1
| 2,016 |
13,999 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1
| 2,016 |
38,452 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1
| 2,016 |
5,160 |
def sort(a):
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
169d7a9e-d0dd-4e8b-937d-fcd76c099acc
| 2,016 |
28,393 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
smallest = i
while i < len(a):
if a[i] < a[smallest]:
smallest = i
i = i + 1
return smallest
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b9519383-96f3-4fcc-b33f-df67f186ba78
| 2,016 |
42,114 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
smallest = i
while i < len(a):
if a[i] < a[smallest]:
smallest = i
i = i + 1
return smallest
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b9519383-96f3-4fcc-b33f-df67f186ba78
| 2,016 |
3,191 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
32,368 |
def sort(a):
i = 0
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
38,847 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
30,698 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
28,468 |
def sort(a):
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0f1cbd69-016d-4739-b232-fed37e5676ad
| 2,016 |
40,305 |
def sort(p):
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0f1cbd69-016d-4739-b232-fed37e5676ad
| 2,016 |
8,110 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
16,076 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
16,502 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5ba5010e-c0ac-4560-9fa6-aadbc278c3f8
| 2,016 |
8,168 |
def sort(p):
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0f1cbd69-016d-4739-b232-fed37e5676ad
| 2,016 |
37,332 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e84d5440-bfc2-41cd-a020-f2cd55cb79b4
| 2,016 |
35,555 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e84d5440-bfc2-41cd-a020-f2cd55cb79b4
| 2,016 |
17,619 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5ba5010e-c0ac-4560-9fa6-aadbc278c3f8
| 2,016 |
42,199 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
5ba5010e-c0ac-4560-9fa6-aadbc278c3f8
| 2,016 |
23,723 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
3bb099c4-4248-4efd-bfe2-3c423b916ce0
| 2,016 |
38,999 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
3bb099c4-4248-4efd-bfe2-3c423b916ce0
| 2,016 |
8,177 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
27,744 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
c45598e5-3acc-4052-b18a-228b6bd842f6
| 2,016 |
2,353 |
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
32,017 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
j = i
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
fd20892b-e35f-43bc-b82d-e6db9320b8ae
| 2,016 |
14,763 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
j = i
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
fd20892b-e35f-43bc-b82d-e6db9320b8ae
| 2,016 |
32,309 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
j = i
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
fd20892b-e35f-43bc-b82d-e6db9320b8ae
| 2,016 |
18,276 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
33,185 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
24,965 |
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
31,391 |
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
7,826 |
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
23,734 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
161bb8fd-c916-4d4e-a439-1dce6fc8f542
| 2,016 |
6,337 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
161bb8fd-c916-4d4e-a439-1dce6fc8f542
| 2,016 |
29,660 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
161bb8fd-c916-4d4e-a439-1dce6fc8f542
| 2,016 |
41,623 |
def swap(a, i, j):
a[i], a[j] = a[j], a[i]
def find_position_of_smallest(a, i):
l = a[i:]
s = 0
j = 0
while j < len(l):
if l[j] < l[s]:
s = j
j += 1
return s + len(a) - len(l)
def sort(a):
i = 0
while i < len(a):
smallest = find_position_of_smallest(a, i)
swap(a, i, smallest)
i += 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03141ef3-f364-4b7c-9f52-990a173ac162
| 2,016 |
8,953 |
def swap(a, i, j):
a[i], a[j] = a[j], a[i]
def find_position_of_smallest(a, i):
l = a[i:]
s = 0
j = 0
while j < len(l):
if l[j] < l[s]:
s = j
j += 1
return s + len(a) - len(l)
def sort(a):
i = 0
while i < len(a):
smallest = find_position_of_smallest(a, i)
swap(a, i, smallest)
i += 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03141ef3-f364-4b7c-9f52-990a173ac162
| 2,016 |
4,622 |
def sort(a):
x = int(a[0])
i = 0
while i < len(a) - 1:
if int(a[i]) > int(a[i + 1]):
x = a[i]
a[i] = a[i + 1]
a[i + 1] = x
i = i + 1
i = 0
while i < len(a):
print(a[i])
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ac8b6b8f-d93c-46e5-8736-44e36e620908
| 2,016 |
23,903 |
def sort(a):
x = int(a[0])
i = 0
while i < len(a) - 1:
if int(a[i]) > int(a[i + 1]):
x = a[i]
a[i] = a[i + 1]
a[i + 1] = x
i = i + 1
i = 0
while i < len(a):
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ac8b6b8f-d93c-46e5-8736-44e36e620908
| 2,016 |
19,674 |
def sort(a):
x = int(a[0])
i = 0
while i < len(a) - 1:
if int(a[i]) > int(a[i + 1]):
x = a[i]
a[i] = a[i + 1]
a[i + 1] = x
i = i + 1
i = 0
while i < len(a):
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ac8b6b8f-d93c-46e5-8736-44e36e620908
| 2,016 |
17,424 |
def sort(a):
x = int(a[0])
i = 0
while i < len(a) - 1:
if int(a[i]) > int(a[i + 1]):
x = a[i]
a[i] = a[i + 1]
a[i + 1] = x
i = i + 1
i = 0
while i < len(a):
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
ac8b6b8f-d93c-46e5-8736-44e36e620908
| 2,016 |
16,379 |
def sort(a):
p = 0
j = 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
4205f21d-1c6e-499a-a25c-83a2d9d5ad93
| 2,016 |
36,674 |
def sort(a):
i = 0
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
4205f21d-1c6e-499a-a25c-83a2d9d5ad93
| 2,016 |
38,523 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
23,754 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
41,574 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
9,738 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
161bb8fd-c916-4d4e-a439-1dce6fc8f542
| 2,016 |
1,125 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
161bb8fd-c916-4d4e-a439-1dce6fc8f542
| 2,016 |
12,158 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
9,050 |
def sort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
27,021 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
13,717 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
17,475 |
def square_perimeter(n):
sq = n + n + n + n
return sq
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
27,755 |
def circle_circumference(n):
sq = 2 * 3.14 * n
return sq
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
10,373 |
def circle_area(n):
sq = 3.14 * n ** 2
return sq
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
33,874 |
def rectangle_perimeter(n, b):
sq = n + n + b + b
return sq
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
28,950 |
def square_perimeter(n):
sq = n + n + n + n
return sq
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
34,952 |
def square_perimeter(n):
sq = n + n + n + n
return sq
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
42,197 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
4,718 |
def circle_area(n):
sq = 3.14 * n ** 2
return sq
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
16,630 |
def rectangle_perimeter(n, b):
sq = n + n + b + b
return sq
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
24,637 |
def circle_area(n):
sq = 3.14 * n ** 2
return sq
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
11,073 |
def rectangle_perimeter(n, b):
sq = n + n + b + b
return sq
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.