benchmarks.wiki

benchmarks.wiki / Public workspace

CRUXEval / sample_363 / [1]

Problem

Answer published by the source. Consult the official source to check your work against its answer.

code

Code

def f(nums):
    nums.sort()
    n = len(nums)
    new_nums = [nums[n//2]]
    
    if n % 2 == 0:
        new_nums = [nums[n//2 - 1], nums[n//2]]
    
    for i in range(0, n//2):
        new_nums.insert(0, nums[n-i-1])
        new_nums.append(nums[i])
    return new_nums

input

  • 1

Discussion

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

upstream_id / Original problem ID
sample_363
task_id
140bd994-419f-5500-ba33-d5cb7bf93cdf
task_key
default--test--sample~5f363
task_revision_id
1
config / split
default / test

Official source

initial import