competitive_programming_lib/Sorting/
bubble_sort.rs

1pub fn bubble_sort(arr: &mut [i32]) {
2    let n = arr.len();
3    for i in 0..n {
4        for j in 0..n - i - 1 {
5            if arr[j] > arr[j + 1] {
6                arr.swap(j, j + 1);
7            }
8        }
9    }
10}