Each item is a empirical algorithm complexity curve tester example providing Task description, Implementation (Python), Claimed complexity, Expected outputs at sizes (correctness fixture). Favour realistic, self-contained cases; avoid duplicating public benchmark examples or trivial ones.
Secured after final acceptance. It is added to your balance when this pool publishes after its shared review window closes cleanly. Rejected items do not qualify.
Platform-authored spec, open on delivery.
Measured pipeline stats for this dataset. A dash means the platform does not publish that measure for this pool.
Illustrative samples authored for the Algorithmic Complexity Verification (Empirical Big-O) dataset type.
Given a deterministically-generated pseudo-random list of n integers, sort it and return the sum of the values at even indices of the sorted list.
def solve(n):
data = [(i * 2654435761) % 1009 for i in range(n)]
data.sort()
return sum(data[0::2])
[
[
4,
869
],
[
8,
2187
],
[
16,
3633
],
[
32,
8080
]
]Approved public samples for this Algorithmic Complexity Verification (Empirical Big-O) dataset. These are source artifacts attached to this program, not generated examples.