/Rust/How to make a sorting algorithim rust

How to make a sorting algorithim rust

fn sort(array: &mut Vec<i32>) {
  for i in 0..array.len() {
    for j in 0..array.len() - i - 1 {
      if array[j + 1] < array[j] {
        array.swap(j, j + 1);
      }
    }
  }
}

Source: kirillvasiltsov.com

Similar codes

0 vote126 views1 answer
Rust equivalent of dictionary
Rust
0 vote125 views1 answer
Rust get items in a list with index and value
Rust
1 vote168 views1 answer
Rust check if key in hashmap
Rust
0 vote122 views1 answer
Rust lang enum
Rust
0 vote119 views1 answer
Bevy disable plugin
Rust
0 vote110 views2 answers
Rust char array
Rust
0 vote121 views1 answer
Rust get items in a list
Rust
0 vote114 views1 answer
Rust create directory if not exists
Rust
0 vote166 views1 answer
Rust the size for values of type `str` cannot be known at compilation time\nthe trait `Sized` is not implemented for `str`
Rust
1 vote120 views1 answer
Bevy window descriptor
Rust