Question

How to implement the bubble sort algorithm in Rust

Answer 1

fn bubble_sort(arr: &mut [i32]) {
    let mut size = arr.len();
    let mut swapped = true;

    while swapped {
        swapped = false;
        for i in 1..size {
            if arr[i - 1] > arr[i] {
                arr.swap(i - 1, i);
                swapped = true;
            }
        }
        size -= 1;
    }
}

fn main() {
    let mut arr = [3, 14, 4, 1, 5, 90, 2, 6, 89, 7];

    bubble_sort(&mut arr);
    
    println!("Sorted array: {:?}", arr);
}


  
/*
run:
  
Sorted array: [1, 2, 3, 4, 5, 6, 7, 14, 89, 90]
 
*/

 

70+ SQL courses for beginners and professionals