Sorting
2026/3/9小于 1 分钟
Sorting
题面
将 float32 数组按升序排序,算法自选(如基数/归并/块内排序+全局归并等)。
Implementation Requirements
- Use only native features (external libraries are not permitted)
- The solve function signature must remain unchanged
- 排序结果写回输入数组
Examples
data=[5,2,8,1,9,4] → [1,2,4,5,8,9]Constraints
- 1 ≤ N ≤ 1,000,000;Performance: N = 1,000,000