ruby 中想对数组中间的一段进行排序，我知道可以这样：
a[1..2] = a[1..2].sort!
但这样会有一次拷贝，出于效率原因希望不产生任何拷贝，直接在原数组上排序。
认证0级讲师
Sort only copies the structure of the array, and the contents of the array will not be copied, so the impact on performance is minimal.
What amount of data will make this code a performance bottleneck?
Using the sort method will regenerate a new array. You can use the array subscript to take out the elements for comparison, and just swap the positions
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
Sort only copies the structure of the array, and the contents of the array will not be copied, so the impact on performance is minimal.
What amount of data will make this code a performance bottleneck?
Using the sort method will regenerate a new array. You can use the array subscript to take out the elements for comparison, and just swap the positions