SEARCHING VISUALIZER🔥

Element Present at:

Step Count:

Code in (Java)

                        // Java code for linearly searching x in arr[]. If x
// is present then return its location, otherwise
// return -1 

class GFG {
public static int search(int arr[], int x) 
{
    int N = arr.length;
    for (int i = 0; i < N; i++) {
        if (arr[i] == x)
            return i;
    }
    return -1;
}

// Driver's code
public static void main(String args[])
{
    int arr[] = { 2, 3, 4, 10, 40 };
    int x = 10;

    // Function call
    int result = search(arr, x);
    if (result == -1)
        System.out.print(
            "Element is not present in array");
    else
        System.out.print("Element is present at index "
                        + result);
}
}

Time Complexity

                            > Best- case complexity = O (1) occurs when the search element is present at the first 
element in the search array.
> Worst- case complexity = O (n) occurs when the search element is not present in the 
set of elements or array.
> Average complexity = O (n) is referred to when the element is present somewhere 
in the search array

Time Complexity: O(N)

Space Complexity

                            > As the amount of extra data 
                            in Linear Search is fixed, the Space Complexity is O(1).

                            Space Complexity: O(1).