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
|
|---|---|---|---|---|---|---|---|---|
4,899 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
11,719 |
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 |
d31360b5-795b-45df-bd6f-a99df2683eae
| 2,016 |
40,405 |
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 |
d2330156-60dd-4aca-a925-9aa27e3edb48
| 2,016 |
41,457 |
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 |
d2330156-60dd-4aca-a925-9aa27e3edb48
| 2,016 |
23,408 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, 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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
20,240 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, tmp)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
5,181 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
28,457 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
4,158 |
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 |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
28,796 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
track = 0
tempnum = a[i + track]
while track != len(a) - i:
if a[i + track] == tempnum:
tempnum = a[i + track]
track = track + 1
return tempnum
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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 |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
30,717 |
def sort(a):
tmp = a[j]
a[j] = 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 |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
19,786 |
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
find_position_of_smallest(a, i)
i = tmp
a[0] = tmp
|
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 |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
39,836 |
def sort(a):
i = 0
while i < len(a):
p = i
if a[i] < a[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 |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
3,336 |
def sort(a):
i = 0
j = i
while i < len(a):
if a[i] < a[j]:
j = i
tmp = a[i]
a[i] = a[j]
a[j] = 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 |
e84d5440-bfc2-41cd-a020-f2cd55cb79b4
| 2,016 |
41,274 |
def sort(a):
i = 0
while i < len(a):
p = i
if a[i] < a[p]:
tmp = a[i]
a[i] = a[p]
a[p] = 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 |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
18,833 |
def sort(a):
i = 0
j = i
while i < len(a):
if a[i] < a[j]:
j = i
tmp = a[i]
a[i] = a[j]
a[j] = 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 |
e84d5440-bfc2-41cd-a020-f2cd55cb79b4
| 2,016 |
22,434 |
def sort(a):
i = 0
while i < len(a):
p = i
if a[i] < a[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
| true |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
36,815 |
def sort(a):
tmp = a[j]
a[j] = 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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
3,318 |
def sort(a):
i = 0
while i < len(a):
j = i
while i < len(a):
if a[i] < a[j]:
tmp = a[i]
a[i] = a[j]
a[j] = 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 |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
10,324 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
27,012 |
def sort(a):
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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
10,556 |
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 |
4490d043-a9e0-48aa-a62c-ddcc67ed7fba
| 2,016 |
24,101 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while j < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
find_position_of_smallest
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
29,545 |
def sort(a):
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
| false |
12d00542-0a26-4a35-a142-ccd508484c14
| 2,016 |
2,655 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while j < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
39,750 |
def sort(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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
35,512 |
def sort(a):
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
| false |
12d00542-0a26-4a35-a142-ccd508484c14
| 2,016 |
18,492 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
swap(a, i, 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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
36,293 |
def sort(a):
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
| false |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
18,868 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
e84d5440-bfc2-41cd-a020-f2cd55cb79b4
| 2,016 |
31,029 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
swap(a, i, j)
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
42,403 |
def sort(a):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
|
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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
13,505 |
def sort(a):
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
| false |
12d00542-0a26-4a35-a142-ccd508484c14
| 2,016 |
20,574 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
track = 0
tempnum = a[i + track]
while track != len(a) - i:
if a[i + track] < tempnum:
tempnum = a[i + track]
track = track + 1
return track + i - 1
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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
| true |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
3,199 |
def sort(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
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
32,981 |
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 |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
22,944 |
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 |
058b18f6-cf34-4afc-8b4e-0f7705be27f0
| 2,016 |
38,420 |
def sort(a):
p = i
j = i + 1
i = 0
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
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
26,098 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
swap(a, i, 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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
30,167 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while j < 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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
27,658 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
return k
|
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 |
15,429 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
return k
|
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 |
1,739 |
def sort(a):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
tmp = a[i]
a[i] = a[j]
a[j] = 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 |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
20,897 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
i = 0
j = 0
while j < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
17,136 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i = i + 1
return k
|
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 |
15,207 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, i)
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
17,349 |
def sort(a):
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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
30,984 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
4,265 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
36,004 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
6,782 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
1952771b-859e-46c9-8146-448dc8ef5870
| 2,016 |
9,719 |
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 |
12d00542-0a26-4a35-a142-ccd508484c14
| 2,016 |
5,460 |
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 |
12d00542-0a26-4a35-a142-ccd508484c14
| 2,016 |
38,159 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 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
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
30,872 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 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
| false |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
24,975 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = a[k]
a[k] = 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 |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
370 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, i)
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 |
d31360b5-795b-45df-bd6f-a99df2683eae
| 2,016 |
8,690 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
10,393 |
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):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
9,273 |
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 |
6aa0e790-273f-4239-98eb-0b504997b70b
| 2,016 |
22,725 |
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
6,402 |
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
33,689 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, i)
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 |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
3,593 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, i)
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 |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
6,465 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
15,922 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
7,290 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
23,568 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
d31360b5-795b-45df-bd6f-a99df2683eae
| 2,016 |
32,747 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
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 |
d31360b5-795b-45df-bd6f-a99df2683eae
| 2,016 |
33,575 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
6618fe7e-6fd3-499b-a742-8d68ec712ad3
| 2,016 |
13,866 |
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
| false |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
21,672 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
4490d043-a9e0-48aa-a62c-ddcc67ed7fba
| 2,016 |
14,825 |
def sort(a):
i = 0
while i < len(a):
j = i
k = i + 1
while k < len(a):
if a[k] < a[j]:
j = k
k = k + 1
tmp = a[j]
a[j] = 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 |
4490d043-a9e0-48aa-a62c-ddcc67ed7fba
| 2,016 |
40,576 |
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
| false |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
24,100 |
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 |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
755 |
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 |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
348 |
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, 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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
14,614 |
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, 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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
39,204 |
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 |
5ba5010e-c0ac-4560-9fa6-aadbc278c3f8
| 2,016 |
5,012 |
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, 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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
20,670 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = 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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
2,708 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = 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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
21,833 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = 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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
33,500 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
tempnum = i
while i + 1 != len(a):
if a[i] < a[tempnum]:
tempnum = i
i = i + 1
return tempnum
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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
| true |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
38,753 |
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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
38,265 |
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 |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
41,437 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
tempnum = i
while i != len(a):
if a[i] < a[tempnum]:
tempnum = i
i = i + 1
return tempnum
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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
| true |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
15,737 |
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 |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
255 |
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 |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
17,526 |
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 |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
32,611 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
i = 0
while i < len(a):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
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 |
18,901 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
tempnum = i
while i != len(a):
if a[i] < a[tempnum]:
tempnum = i
i = i + 1
return tempnum
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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
| true |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
11,078 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
tempnum = i
while i != len(a):
if a[i] < a[tempnum]:
tempnum = i
i = i + 1
return tempnum
def sort(a):
i = 0
j = 0
while i != len(a):
j = 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
| true |
c601c339-f2b7-4564-a96b-2de852eabb7b
| 2,016 |
19,624 |
def sort(a):
i = 0
while i < len(a):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
swap
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 |
14,646 |
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
def sort(a):
i = 0
while i < len(a):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
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 |
9de68f60-663e-4929-b3e2-88948f90a669
| 2,016 |
37,818 |
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)
|
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 |
31,425 |
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 = 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
|
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 |
37,353 |
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
temp = a[p]
a[p] = a[i]
a[i] = temp
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 |
40,442 |
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 = 1
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 |
18,090 |
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
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
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.