|
Download benchmarks/Algorithms/insertion_sort/problem.md from PV-SJTU/PV-Bench: direct link, hf CLI and curl.
- Browser
- Download file 443 Bytes
-
https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Algorithms/insertion_sort/problem.md
- Command line
-
hf download hf://datasets/PV-SJTU/PV-Bench/benchmarks/Algorithms/insertion_sort/problem.md
-
curl -L -o problem.md https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Algorithms/insertion_sort/problem.md
443 Bytes
Insertion Sort
Description
Sort an integer array into nondecreasing order using insertion sort.
Input
The verification-case input consists of an integer array nums and its length numsSize.
Output
The function produces the same values in nondecreasing order.
Constraints
- The array length is positive and fits in a signed C
int.
Source
Classical algorithmic problem reconstructed from the verified C artifact.