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
|
|---|---|---|---|---|---|---|---|---|
818 | def bsearch(a, q):
low = 0
high = len(a)
while low != high:
m = (low + high) / 2
if a[m] < q:
low = m + 1
else:
high = m
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 831aaa20-0b62-4198-b323-52fc0aa8363b | 2,016 |
13,540 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 5bdbfa0a-a632-46ed-9ff7-06f5062efb09 | 2,016 |
9,407 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 5bdbfa0a-a632-46ed-9ff7-06f5062efb09 | 2,016 |
23,542 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 27057d38-c1f9-4b8d-a26e-f287a0546d33 | 2,016 |
24,190 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 27057d38-c1f9-4b8d-a26e-f287a0546d33 | 2,016 |
3,886 | def bsearch(a, q):
low = 0
high = len(a)
while low != high:
mid = (high + low) / 2
if a[mid] < q:
low = mid
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | e65c3029-39bf-4873-8e7a-599cb24be899 | 2,016 |
29,982 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
elif a[mid] >= q:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 0f25ed97-3bfd-4793-bb56-26c57236aeda | 2,016 |
1,975 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
elif a[mid] >= q:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 0f25ed97-3bfd-4793-bb56-26c57236aeda | 2,016 |
16,926 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 16011fd4-f5e2-4c2c-b014-86692ff746d5 | 2,016 |
41,657 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 16011fd4-f5e2-4c2c-b014-86692ff746d5 | 2,016 |
17,735 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if low < q:
low = low + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4 | 2,016 |
23,424 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | fc726678-a7a5-405b-bc49-844b42ef4a2b | 2,016 |
22,610 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | fc726678-a7a5-405b-bc49-844b42ef4a2b | 2,016 |
18,754 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 8487432c-a440-40f5-afcb-ad0e762b9edb | 2,016 |
17,037 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 8487432c-a440-40f5-afcb-ad0e762b9edb | 2,016 |
10,061 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c0d569cd-4374-4e65-8e98-e814031fb3ca | 2,016 |
10,397 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c0d569cd-4374-4e65-8e98-e814031fb3ca | 2,016 |
39,537 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2b5f9b04-bd61-4108-b289-84a2c1002a82 | 2,016 |
35,037 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a758f933-ec7a-444d-b3d2-f685ac9d9563 | 2,016 |
15,533 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 24b328b2-2b24-43bc-9468-d9ba1d7df521 | 2,016 |
23,632 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 24b328b2-2b24-43bc-9468-d9ba1d7df521 | 2,016 |
16,074 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 50d273d2-c9d2-425d-a22d-cc7338b6bc3e | 2,016 |
41,312 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 50d273d2-c9d2-425d-a22d-cc7338b6bc3e | 2,016 |
4,363 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 6fb1b046-1d89-4162-8437-722d44e22f50 | 2,016 |
16,345 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 6fb1b046-1d89-4162-8437-722d44e22f50 | 2,016 |
13,167 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < a
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2bb8ff82-061d-43cd-a020-a2cffad09d1e | 2,016 |
41,846 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 213d8254-d887-4b88-8234-2f2edbe536aa | 2,016 |
7,995 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 213d8254-d887-4b88-8234-2f2edbe536aa | 2,016 |
1,482 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < a
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2bb8ff82-061d-43cd-a020-a2cffad09d1e | 2,016 |
22,713 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < a
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2bb8ff82-061d-43cd-a020-a2cffad09d1e | 2,016 |
41,509 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | e65c3029-39bf-4873-8e7a-599cb24be899 | 2,016 |
15,504 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | e65c3029-39bf-4873-8e7a-599cb24be899 | 2,016 |
11,114 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2b5f9b04-bd61-4108-b289-84a2c1002a82 | 2,016 |
6,407 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 2b5f9b04-bd61-4108-b289-84a2c1002a82 | 2,016 |
5,090 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | e3c31dbf-4c63-4e59-aa78-540cb586910e | 2,016 |
15,942 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | e3c31dbf-4c63-4e59-aa78-540cb586910e | 2,016 |
3,209 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if low < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4 | 2,016 |
12,361 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a0677365-0929-4e2e-8719-3729105927cd | 2,016 |
19,331 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a0677365-0929-4e2e-8719-3729105927cd | 2,016 |
21,466 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 09e5a143-ae3a-4611-8cfa-45d52e07b2c6 | 2,016 |
7,558 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c8ff27a3-b9c4-40dd-95d5-68feefbafff7 | 2,016 |
28,060 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 09e5a143-ae3a-4611-8cfa-45d52e07b2c6 | 2,016 |
887 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c8ff27a3-b9c4-40dd-95d5-68feefbafff7 | 2,016 |
37,458 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 995eab58-b496-45c9-aacf-4878531bfc6f | 2,016 |
40,720 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 07a2a74b-d2da-4f91-ba7e-5881b51fd5e4 | 2,016 |
40,790 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 07a2a74b-d2da-4f91-ba7e-5881b51fd5e4 | 2,016 |
21,787 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 3299788f-7847-4a87-af83-a4ce95b853ee | 2,016 |
9,446 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 3299788f-7847-4a87-af83-a4ce95b853ee | 2,016 |
1,611 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 03ce4b42-26f0-456c-9d48-18c0d16bec55 | 2,016 |
22,507 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 00ee78cc-7a00-47a7-85bb-9c524dad656c | 2,016 |
29,789 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 00ee78cc-7a00-47a7-85bb-9c524dad656c | 2,016 |
2,246 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid
else:
high = mid + 1
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c8ff27a3-b9c4-40dd-95d5-68feefbafff7 | 2,016 |
41,793 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c8ff27a3-b9c4-40dd-95d5-68feefbafff7 | 2,016 |
19,906 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | c8ff27a3-b9c4-40dd-95d5-68feefbafff7 | 2,016 |
2,219 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 97b1fa02-4c4e-425b-a371-6b1b38862a02 | 2,016 |
11,755 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 97b1fa02-4c4e-425b-a371-6b1b38862a02 | 2,016 |
35,154 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 9ae0539b-3842-4209-9c3e-252c74db087e | 2,016 |
5,281 | def bsearch(a, q):
low = 0
high = len(a) - 1
mid = 0
while low < len(a) and a[low] < q:
mid = (high + low) // 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | true | 2ff47805-d62a-4ff9-9297-d30f89b68639 | 2,016 |
40,465 | def bsearch(a, q):
low = 0
high = len(a) - 1
mid = 0
while low < len(a) and a[low] < q:
mid = (high + low) // 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | true | 2ff47805-d62a-4ff9-9297-d30f89b68639 | 2,016 |
18,313 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 995eab58-b496-45c9-aacf-4878531bfc6f | 2,016 |
25,172 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 995eab58-b496-45c9-aacf-4878531bfc6f | 2,016 |
34,501 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 9ae0539b-3842-4209-9c3e-252c74db087e | 2,016 |
37,761 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 9ae0539b-3842-4209-9c3e-252c74db087e | 2,016 |
8,926 | def bsearch(a, q):
low = 0
high = len(a)
print(q)
print(a, len(a))
print(low, high)
while low != high:
mid = (low + high) / 2
if a[mid] < q:
0
else:
0
print(q)
print(a, len(a))
print(low, mid, high)
assert low == 0 or a[low - 1] < q
assert high == len(a) or q <= a[high]
low = high
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 553c9a10-8e3d-401b-8100-2094287197ed | 2,016 |
35,920 | def bsearch(a, q):
low = 0
high = len(a)
print(q)
print(a, len(a))
print(low, high)
while low != high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
print(q)
print(a, len(a))
print(low, mid, high)
assert low == 0 or a[low - 1] < q
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 553c9a10-8e3d-401b-8100-2094287197ed | 2,016 |
31,740 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | f565987c-8fbf-4b95-b405-cf1a3ccac8f5 | 2,016 |
7,657 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | f565987c-8fbf-4b95-b405-cf1a3ccac8f5 | 2,016 |
6,685 | def bsearch(a, q):
low = 0
high = len(a)
while low != high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
print(q)
print(a, len(a))
print(low, mid, high)
assert low == 0 or a[low - 1] < q
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 553c9a10-8e3d-401b-8100-2094287197ed | 2,016 |
14,459 | def bsearch(a, q):
low = 0
high = len(a)
while low != high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
assert low == 0 or a[low - 1] < q
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 553c9a10-8e3d-401b-8100-2094287197ed | 2,016 |
3,128 | def bsearch(a, q):
low = 0
high = len(a)
while low != high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
assert low == 0 or a[low - 1] < q
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 553c9a10-8e3d-401b-8100-2094287197ed | 2,016 |
39,584 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert low == 0 or a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
30,876 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4 | 2,016 |
19,696 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4 | 2,016 |
22,098 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
24,696 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
25,216 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
26,133 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
30,539 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7352a7ab-bc53-49d3-8ca7-32aa046fe82d | 2,016 |
12,485 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + high / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56 | 2,016 |
22,392 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high] | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
40,400 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[middle] < q:
low = middle
assert low == 0 or a[low - 1] < q
else:
high = middle
assert high == len(a) or q <= a[high] | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
16,756 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return high | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7d63d843-7e5d-4c24-a378-1056c311dfd2 | 2,016 |
30,633 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (high + low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return high | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 7d63d843-7e5d-4c24-a378-1056c311dfd2 | 2,016 |
17,648 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56 | 2,016 |
22,622 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = low + (high - low) / 2
if a[mid] < q:
low = mid + 1
else:
high = mid
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56 | 2,016 |
4,391 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[middle] < q:
low = middle
assert low == 0 or a[low - 1] < q
else:
high = middle
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
29,446 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[middle] < q:
low = middle
assert low == 0 or a[low - 1] < q
else:
high = middle
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
9,988 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid < high
if a[mid] < q:
low = mid + 1
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 587649dc-83bf-4c24-bb43-de304405f3b9 | 2,016 |
849 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[middle] < q:
low = middle
assert low == 0 or a[low - 1] < q
else:
high = middle
assert high == len(a) or q <= a[high]
return low[i] | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
18,192 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a758f933-ec7a-444d-b3d2-f685ac9d9563 | 2,016 |
18,449 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high] | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
17,821 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return low, high | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
9,609 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return mid | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
9,872 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return high - low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
25,603 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return len(a) | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
5,734 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
middle = (low + high) / 2
if a[middle] < q:
low = middle + 1
assert low == 0 or a[low - 1] < q
else:
high = middle
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | 54e7d279-e8ef-49c1-8aea-de3ac0b230cf | 2,016 |
29,829 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
38,464 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
if a[mid] < q:
low = mid
assert low == 0 or a[low - 1] < q
else:
high = mid
assert high == len(a) or q <= a[high]
return high | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6 | 2,016 |
5,054 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a758f933-ec7a-444d-b3d2-f685ac9d9563 | 2,016 |
35,600 | def bsearch(a, q):
low = 0
high = len(a)
while low < high:
mid = (low + high) / 2
assert low <= mid and mid < high
if a[mid] < q:
low = mid + 1
assert a[low - 1] < q
else:
high = mid
assert q <= a[high]
return low | bsearch | bsearch | Search for element q in the sorted array a. | assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3 | false | a758f933-ec7a-444d-b3d2-f685ac9d9563 | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.