SEARCHING

Element Present at:

Step Count:

Code in (c++)

                        // C++ Program to implement linear search 
                            // algorithm iteratively
                         
                            
                            int linearSearch(vector v, int key) {
                                  
                                  // We test all the elements of the vector
                                  // v against the given key
                                  for (int i = 0; i < v.size(); i++) {
                                  
                                      // If the KEY IS FOUND
                                      if (v[i] == key) {
                                          return i;
                                    }
                                }
                                  
                                  // Return some value denoting KEY NOT FOUND
                                  return -1;
                            }

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).