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
|
|---|---|---|---|---|---|---|---|---|
22,972 |
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 |
38,992 |
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 |
25,564 |
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 |
42,484 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
40,079 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
25,950 |
def circle_area(r):
cir = 3.14 * (r * r)
return cir
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
6,424 |
def circle_circumference(r):
circum = 2 * 3.14 * r
return circum
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
29,684 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
29,962 |
def square_perimeter(side):
perimeter = side * 4
return perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
34,168 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
1,048 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
31,939 |
def circle_area(r):
cir = 3.14 * (r * r)
return cir
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
28,051 |
def square_perimeter(side):
perimeter = side * 4
return perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
29,483 |
def circle_circumference(r):
circum = 2 * 3.14 * r
return circum
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
4,604 |
def rectangle_perimeter(a, b):
per = a * 2 + b * 2
return per
|
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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
40,468 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
42,343 |
def circle_circumference(r):
circum = 2 * 3.14 * r
return circum
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
13,293 |
def circle_area(r):
cir = 3.14 * (r * r)
return cir
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
41,539 |
def square_area(side):
sq = side * side
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
12,630 |
def rectangle_perimeter(a, b):
per = a * 2 + b * 2
return per
|
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 |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
5,218 |
def square_perimeter(side):
perimeter = side * 4
return perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c
| 2,016 |
28,444 |
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 += 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 |
f40d6a8a-0620-4bda-8c98-4c952edace05
| 2,016 |
6,574 |
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 += 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 |
f40d6a8a-0620-4bda-8c98-4c952edace05
| 2,016 |
19,552 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
i = 0
while i < len(a):
p = position_of_smallest(a, i)
swap(a, i, p)
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 |
415d4431-1b98-4241-a978-02dc16bf556e
| 2,016 |
19,152 |
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, p)
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 |
415d4431-1b98-4241-a978-02dc16bf556e
| 2,016 |
26,081 |
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, p)
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 |
415d4431-1b98-4241-a978-02dc16bf556e
| 2,016 |
37,141 |
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, p)
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 |
169d7a9e-d0dd-4e8b-937d-fcd76c099acc
| 2,016 |
23,409 |
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, p)
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 |
169d7a9e-d0dd-4e8b-937d-fcd76c099acc
| 2,016 |
37,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
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 |
30,918 |
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 |
2,083 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
while i < len(a):
p = find_position_of_smallest
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 |
2a1a0a7b-975b-4463-96bb-4f52900ce463
| 2,016 |
25,855 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
i = 0
p = i
i = i + 1
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 += 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 |
9413c2ae-94cc-4b45-8180-0919de97fe15
| 2,016 |
7,957 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
while i < len(a):
p = find_position_of_smallest
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 |
2a1a0a7b-975b-4463-96bb-4f52900ce463
| 2,016 |
28,208 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
while i < len(a):
p = find_position_of_smallest
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 |
2a1a0a7b-975b-4463-96bb-4f52900ce463
| 2,016 |
38,967 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
while i < len(a):
p = find_position_of_smallest
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 |
2a1a0a7b-975b-4463-96bb-4f52900ce463
| 2,016 |
33,546 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
i = p
p = i
i = i + 1
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 += 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 |
9413c2ae-94cc-4b45-8180-0919de97fe15
| 2,016 |
8,141 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
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 |
32,655 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
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 |
5,873 |
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 |
11,860 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
1,174 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
16,435 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
10,698 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
41,055 |
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 |
20,367 |
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 |
38,026 |
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 |
25,286 |
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 |
21,349 |
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 |
29,055 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
38,206 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
30,817 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
27,135 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
5,167 |
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, 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 |
762404df-24ca-44ff-9c98-3f841fa7faab
| 2,016 |
15,342 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
15,049 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
29,434 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
32,407 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
41,913 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
2,749 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
37,263 |
def rectangle_perimeter(x1, y1, x2, y2):
dx = x1 - x2
dy = y1 - y2
area = dx * dy
if 0 <= area:
return area
|
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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
34,149 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
23,117 |
def rectangle_perimeter(x1, y1, x2, y2):
dx = x1 - x2
dy = y1 - y2
area = dx * dy
if 0 <= area:
return area
|
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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
23,864 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
26,943 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
1,308 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
33,497 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
i = 0
while i < len(a):
if a[i] < a[j]:
i = i + 1
return i
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
37,114 |
def square_area(n):
sq = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| false |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
2,564 |
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 |
db184e8e-e02b-4772-b74b-547b88d21933
| 2,016 |
21,944 |
def sort(a):
p = i + 1
i = i + 2
while i < len(a):
if a[i] < a[p]:
p = i
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 |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
12,930 |
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 = p + 1
while i < len(a):
if a[j] < a[p]:
p = j
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
38,868 |
def square_area(n):
sq = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| false |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
28,544 |
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 |
db184e8e-e02b-4772-b74b-547b88d21933
| 2,016 |
27,532 |
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 |
14,963 |
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 |
33,007 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
967 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
11,550 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
23,391 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
40,547 |
def rectangle_perimeter(x1, y1, x2, y2):
dx = x1 - x2
dy = y1 - y2
perimeter = dx * dy
if 0 <= area:
return area
|
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
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
23,389 |
def square_area(n):
results = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| false |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
14,321 |
def sort(a):
p = i
j = i + 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 |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
7,591 |
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 = p + 1
while i < len(a):
if a[p] < a[j]:
j = p
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
39,007 |
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 = p + 1
while i < len(a):
if a[p] < a[j]:
j = p
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
23,359 |
def square_area(n):
result = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
23,631 |
def square_area(n):
result = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
39,912 |
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, p)
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 |
06043f63-bd06-4b6c-9b40-184b4eca2307
| 2,016 |
485 |
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 = p + 1
while i < len(a):
if a[j] < a[p]:
j = p
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
21,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, i, p)
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 |
06043f63-bd06-4b6c-9b40-184b4eca2307
| 2,016 |
24,594 |
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, p)
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 |
06043f63-bd06-4b6c-9b40-184b4eca2307
| 2,016 |
10,319 |
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
38,522 |
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
i = i + 1
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
39,205 |
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
|
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 |
dcc2a3d3-d90d-4640-9797-7d037bff9027
| 2,016 |
18,448 |
def sort(a):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
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 |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
13,789 |
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 = p + 1
while j < len(a):
if a[j] < a[p]:
p = j
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
26,129 |
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
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
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
10,206 |
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
i = i + 1
tmp = a[p]
a[p] = a[i]
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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
1,682 |
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, p)
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 |
e5f35cd7-8337-4a68-bda3-4164a982feae
| 2,016 |
31,927 |
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
i = i + 1
tmp = a[p]
a[p] = 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 |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
14,133 |
def sort(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = 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
| false |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
35,247 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.