The following code gives an implementation of linear search algorithm on an array. public static int...

Transcribed Image Text:

The following code gives an implementation of linear search algorithm on an array. 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; What is the time complexity of the above linear search algorithm? The following code gives an implementation of linear search algorithm on an array. 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; What is the time complexity of the above linear search algorithm?

Answer rating: 100% (QA)

It appears that there is a syntax error in the provided code snippet I assume there is a missing sem... View the full answer