algorithmplus 0.1.4

Library of commonly used algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

/// Search for an element in an array using linear search
///
/// # Parameters
///
/// - `target`: The element to find
/// - `arr`: A vector to search the element in
///
/// # Type parameters
///
/// - `T`: A type that can be checked for equality and ordering e.g. a `i32`, a
///     `u8`, or a `f32`.
///
/// # Examples
///
/// ```rust
/// use algorithmplus::search::linear_search;
/// 
/// let ls = vec![7, 1, -1, 10, 12];
/// let idx = linear_search(&10, &ls).unwrap_or_default();
/// 
/// assert_eq!(idx, 3);
/// ```
/// 
/// ```rust
/// use algorithmplus::search::linear_search;
/// 
/// let ls = vec![4, 1, 2, 11, -7];
/// let idx = linear_search(&8, &ls);
/// 
/// assert_eq!(idx, None);
/// ```

pub fn linear_search<T: PartialEq + PartialOrd>(target: &T, arr: &[T]) -> Option<usize> {
    let arr_len = arr.len();

    if arr_len == 0 {
        return None;
    }

    for (idx, value) in arr.iter().enumerate() {
        if value == target {
            return Some(idx);
        }
    }
    None
}