benchmarks.wiki / Public workspace
CRUXEval / sample_185 / [16, 14, 12, 7, 9, 11]
Problem
Answer published by the source. Consult the official source to check your work against its answer.
code
Code
def f(L):
N = len(L)
for k in range(1, N//2 + 1):
i = k - 1
j = N - k
while i < j:
# swap elements:
L[i], L[j] = L[j], L[i]
# update i, j:
i += 1
j -= 1
return Linput
16
14
12
7
9
11
Discussion
No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.
See answer Answer published by the source
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.
Source and history
initial import