Bubble sort benchmark

bubble.js

const bubble_sort = (arr) => {
  const n = arr.length;
  for (let i = 0; i < n; i++) {
    for (let j = 0; j < n - i - 1; j++) {
      if (arr[j] > arr[j + 1]) {
        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
      }
    }
  }
  return arr;
}

const getRandomInt = max => {
  return Math.floor(Math.random() * max);
}

const n = parseInt(process.argv[2]);
arr = Array.from({length: n}, _ => getRandomInt(n));
bubble_sort(arr);

bubble.py

import random
import sys


def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr


if __name__ == '__main__':
    n = int(sys.argv[1])
    arr = [random.randint(0, n - 1) for _ in range(n)]
    bubble_sort(arr)

bubble.rs

use std::env;
use std::fs::File;
use std::io::Read;

fn bubble_sort(arr: &mut Vec<u32>) -> &mut Vec<u32> {
    let n: usize = arr.len();
    for i in 0..n {
        for j in 0..n-i-1 {
            if arr[j] > arr[j+1] {
                arr.swap(j, j+1);
            }
        }
    }
    return arr;
}

pub fn main() {
    let args: Vec<String> = env::args().skip(1).collect();
    let n: u32 = args[0].parse().unwrap();
    let mut arr: Vec<u32> = Vec::new();
    let mut f = File::open("/dev/urandom").unwrap();
    let mut buf = [0u8; 4];
    for _ in 0..n {
        f.read(&mut buf).unwrap();
        arr.push(u32::from_ne_bytes(buf) % n);
    }
    bubble_sort(&mut arr);
}