algorithmz 1.2.2

This is the corresponding implemenation of the python module of the same name.
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

/// Longest common prefix
///
/// Find the longest common prefix string amongst an array of strings. Three approaches: horizontal scanning, vertical scanning, and divide and conquer.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::string::longest_common_prefix("flower", "flow");
/// assert_eq!(result, String::from("flow"));
/// ```
pub fn longest_common_prefix(first: &str, second: &str) -> String {
    if first.len() == 0 || second.len() == 0 {
        return String::from("");
    }
    let first_bytes = first.as_bytes();
    let second_bytes = second.as_bytes();
    let mut index: usize = 0;
    while first_bytes[index] == second_bytes[index] {
        index = index + 1;
        if index >= first_bytes.len() || index >= second_bytes.len() {
            return String::from_utf8(first_bytes[0..index].to_vec()).unwrap();
        }
    }
    return String::from_utf8(first_bytes[0..index].to_vec()).unwrap();
}