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
|
|---|---|---|---|---|---|---|---|---|
11,016 | 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 |
18,289 | 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,131 | def rectangle_perimeter(x1, y1):
rectancle_perimeter = 2 * x1 * y1
return rectangle_perimeter | 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 |
9,012 | 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 |
41,187 | 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 |
19,771 | 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 |
31,345 | 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 |
40,144 | def rectangle_perimeter(x1, y1):
rectancle_perimeter = 2 * x1 * y1
return rectangle_perimeter | 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 |
18,787 | 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 |
20,102 | 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 |
14,137 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
87 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(n + r)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
6,776 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
39,044 | def square_area(r):
square_area = r * r
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 |
3,605 | def square_perimeter(r):
sqaure_perimeter = r * 4
return square_perimeter | square_perimeter | square_perimeter | Returns the perimeter of a square. | assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
40,707 | 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 |
40,694 | 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 |
22,776 | 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_postion_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 | false | fd20892b-e35f-43bc-b82d-e6db9320b8ae | 2,016 |
42,380 | def sort(a):
i = 0
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 |
26,507 | 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 |
39,562 | 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 |
17,918 | 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 |
6,253 | def rectangle_perimeter(x1, y1):
rectancle_perimeter = 2 * (x1 * y1)
return rectangle_perimeter | 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,012 | 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 |
3,080 | def sort(a):
i = 0
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[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 |
14,395 | def sort(a):
i = 0
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 |
5,304 | 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 |
34,265 | 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_postion_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 | false | fd20892b-e35f-43bc-b82d-e6db9320b8ae | 2,016 |
8,842 | 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_postion_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 | false | fd20892b-e35f-43bc-b82d-e6db9320b8ae | 2,016 |
40,095 | 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_postion_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 | false | fd20892b-e35f-43bc-b82d-e6db9320b8ae | 2,016 |
34,794 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
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 = 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 | a93c9eeb-104a-4436-bd9a-c2e65d311d9e | 2,016 |
20,967 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
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 = 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 | a93c9eeb-104a-4436-bd9a-c2e65d311d9e | 2,016 |
30,320 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
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 |
25,094 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
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 |
32,861 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
31,506 | def square_perimeter(r):
sqaure_perimeter = r * 4
return square_perimeter | square_perimeter | square_perimeter | Returns the perimeter of a square. | assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
36,609 | def square_area(r):
square_area = r * r
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 |
22,853 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
34,384 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
2,409 | def square_area(r):
square_area = r * r
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 |
22,414 | def square_perimeter(r):
sqaure_perimeter = r * r * r * r
return square_perimeter | square_perimeter | square_perimeter | Returns the perimeter of a square. | assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
19,646 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
41,823 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
16,053 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
26,181 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1 | sort | sort | Sort a list by repeatedly moving the minimimum of the remaining sublist to the front. | assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None | true | db184e8e-e02b-4772-b74b-547b88d21933 | 2,016 |
10,511 | def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
j = i
while i < len(a):
if a[i] < a[j]:
j = i
i = i + 1
return j
def sort(a):
i = 0
while i < len(a):
k = find_position_of_smallest(a, i)
swap(a, i, k)
i = i + 1 | sort | sort | Sort a list by repeatedly moving the minimimum of the remaining sublist to the front. | assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None | true | db184e8e-e02b-4772-b74b-547b88d21933 | 2,016 |
15,450 | 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
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 | 0ea9000e-74e5-4eea-8653-1bfeeae4aab1 | 2,016 |
8,732 | 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
j = i + 1
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1 | sort | sort | Sort a list by repeatedly moving the minimimum of the remaining sublist to the front. | assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None | false | 0ea9000e-74e5-4eea-8653-1bfeeae4aab1 | 2,016 |
19,828 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
41,209 | def square_perimeter(r):
sqaure_perimeter = r * r * r * r
return square_perimeter | square_perimeter | square_perimeter | Returns the perimeter of a square. | assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
9,295 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
8,977 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
38,095 | def square_area(r):
square_area = r * r
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 |
34,973 | 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
j = i + 1
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
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 |
35,424 | 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,746 | 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 |
16,207 | def rectangle_perimeter(x1, y1):
rectancle_perimeter = 2 * (x1 * y1)
return rectangle_perimeter | 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 |
18,193 | 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 |
1,088 | 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 |
31,394 | 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 |
5,735 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
4,763 | 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 |
42,480 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
7,461 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
35,390 | def square_perimeter(n):
sqaure_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 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
37,305 | 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():
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 | false | f1f904a5-bcf8-461e-8792-f0a8d0db3f47 | 2,016 |
14,305 | 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 |
14,153 | 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 |
23,449 | 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 |
34,010 | 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 |
9,677 | 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 |
4,954 | def rectangle_perimeter(x1, y1):
rectancle_perimeter = (2)(x1 * y1)
return rectangle_perimeter | 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 |
22,525 | 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 |
20,790 | 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 | 12d00542-0a26-4a35-a142-ccd508484c14 | 2,016 |
4,134 | 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 | 12d00542-0a26-4a35-a142-ccd508484c14 | 2,016 |
11,807 | 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 | 12d00542-0a26-4a35-a142-ccd508484c14 | 2,016 |
5,159 | 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
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
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 |
9,815 | 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 |
12,197 | 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 |
25,707 | 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 |
37,550 | 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
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = i
i = i + 1 | sort | sort | Sort a list by repeatedly moving the minimimum of the remaining sublist to the front. | assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None | false | 639d0a36-d89c-469e-a1ae-4cadc99d8827 | 2,016 |
27,929 | 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 | f1f904a5-bcf8-461e-8792-f0a8d0db3f47 | 2,016 |
10,651 | 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 | f1f904a5-bcf8-461e-8792-f0a8d0db3f47 | 2,016 |
17,043 | 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 | f1f904a5-bcf8-461e-8792-f0a8d0db3f47 | 2,016 |
27,714 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
31,791 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
15,236 | 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 |
1,270 | def square_perimeter(n):
sqaure_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 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
30,711 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
30,965 | 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
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
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 |
17,766 | 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
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
j = i | sort | sort | Sort a list by repeatedly moving the minimimum of the remaining sublist to the front. | assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None | false | 639d0a36-d89c-469e-a1ae-4cadc99d8827 | 2,016 |
29,729 | def rectangle_perimeter(r, n):
rectangle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
1,902 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
6,811 | 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,160 | 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 | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
14,684 | def square_perimeter(n):
sqaure_perimeter = (4)(n)
return square_perimeter | square_perimeter | square_perimeter | Returns the perimeter of a square. | assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736 | false | d6b9871a-67ab-4c5d-894e-eb5d53fae3d1 | 2,016 |
7,176 | 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 |
41,770 | 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 |
13,716 | 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 |
11,636 | def rectangle_perimeter(r, n):
rectancle_perimeter = (2)(r + n)
return rectangle_perimeter | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.