pub fn selection_sort<T: Ord>(arr: &mut [T])Expand description
Selection sort — qolgan qismdan eng kichigini topib, oldinga qo’yish.
G’oya: i -pozitsiya uchun i..n oralig’idagi minimumni topamiz va almashtiramiz.
Almashtirishlar soni har doim eng ko’pi bilan n ta — yozish (write) qimmat bo’lgan xotirada (masalan, flash) shuning uchun foydali.
- Time: O(n²) har doim, Space: O(1), barqaror emas.
§Misol
use rust_algorithms::sorting::selection_sort;
let mut v = vec![64, 25, 12, 22, 11];
selection_sort(&mut v);
assert_eq!(v, [11, 12, 22, 25, 64]);