/*
 * File: linear_search.rs
 * Created Time: 2023-07-09
 * Author: codingonion (coderonion@gmail.com)
 */

include!("../include/include.rs");

use list_node::ListNode;
use std::cell::RefCell;
use std::rc::Rc;

/* Linear search (array) */
fn linear_search_array(nums: &[i32], target: i32) -> i32 {
    // Traverse array
    for (i, num) in nums.iter().enumerate() {
        // Found the target element, thus return its index
        if num == &target {
            return i as i32;
        }
    }
    // Did not find the target element, thus return -1
    return -1;
}

/* Linear search (linked list) */
fn linear_search_linked_list(
    head: Rc<RefCell<ListNode<i32>>>,
    target: i32,
) -> Option<Rc<RefCell<ListNode<i32>>>> {
    // Found the target node, return it
    if head.borrow().val == target {
        return Some(head);
    };
    // Found the target node, return it
    if let Some(node) = &head.borrow_mut().next {
        return linear_search_linked_list(node.clone(), target);
    }
    // Did not find the target node, thus return None
    return None;
}

/* Driver Code */
pub fn main() {
    let target = 3;

    /* Perform linear search in array */
    let nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
    let index = linear_search_array(&nums, target);
    println!("The index of target element 3 is {}", index);

    /* Perform linear search in linked list */
    let head = ListNode::arr_to_linked_list(&nums);
    let node = linear_search_linked_list(head.unwrap(), target);
    println!("The corresponding node object for target value 3 is {:?}", node);
}