Removes duplicate entries from Vec with a complexity of O(N(N+1)/2).

remove_duplicates.rs

/// Is based on the dual pointer technique where ´current´ iterates as usual,
/// but ´runner´ iterates until it hits the ´current´, and then ´current´ proceeds.
pub fn remove_duplicates<'a, T: Eq>(data: &'a mut Vec<T>) {
    let mut current_index = 0;

    while current_index < data.len() {
        let mut runner_index = 0;
        while runner_index < current_index {
            if &data[runner_index] == &data[current_index] {
                data.remove(current_index);
                current_index -= 1;
                break;
            }

            runner_index += 1;
        }

        current_index += 1;
    }
}