search_sort/lib.rs
1//! An implementation of few searching and sorting algorithms.
2//!
3//! This crate is currently WIP, and supports only few of them.
4//! Currently supported algorithms:
5//! - [linear](search::linear) search
6//! - [binary](search::binary) search
7//! - [jump](search::jump) search
8//! - [exponential](search::exp) search
9//! - [bubble](sort::bubble) sort
10//! - [quick](sort::quick) sort
11//! - [merge](sort::merge) sort
12//!
13//! # Quick example
14//! ```
15//! use search_sort::{search, sort};
16//!
17//! let mut slice = [5, 1, 91, -45, 11, 5];
18//! sort::quick(&mut slice);
19//! assert_eq!(slice, [-45, 1, 5, 5, 11, 91]);
20//!
21//! assert_eq!(Some(2), search::binary_first(&slice, &5));
22//! assert_eq!(None, search::binary_first(&slice, &42));
23//! ```
24
25pub mod search;
26pub mod sort;