This repository implements in Rust some algorithms that are known to run in linear time. For a basic understanding of these algorithms, see the References section.
The algorithms are:
- Count sort: it sorts an array of unsigned 1-byte number, which is
u8, in rust. - Radix sort: it sorts an array of unsigned 8-byte number, which is
u64, in rust. - Bucket sort: it sorts an array of floating point numbers, each number must be in the range
[0, 1).
use linear_sort::counting_sort;
fn main() {
let arr: [u8; 7] = [8, 2, 3, 100, 38, 3, 8];
let sorted: Vec<u8> = counting_sort::sort(&arr);
for i in &sorted {
print!("{} ", i);
}
println!("");
}$ cargo run
2 3 3 8 8 38 100 use linear_sort::radix_sort;
fn main() {
let arr: [u64; 7] = [8000, 3000, 38, 100, 38, 3, 3000];
let sorted: Vec<u64> = radix_sort::sort(&arr);
for i in sorted {
print!("{} ", i);
}
println!("");
}$ cargo run
3 38 38 100 3000 3000 8000 use linear_sort::bucket_sort;
fn main() {
let arr: [f64; 7] = [0.6, 0.333, 0.2, 0.8, 0.9, 0.87, 0.65];
let sorted: Vec<f64> = bucket_sort::sort(&arr);
for i in &sorted {
print!("{} ", i);
}
println!("");
}$ cargo run
0.2 0.333 0.6 0.65 0.8 0.87 0.9- Introduction to algorithms / Thomas H. Cormen / Section 8
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent