![b. [496] Write and explain the tightest big-O complexity of these two search algorithms. (The input data is a sorted array.)](https://media.cheggcdn.com/media%2F6fa%2F6fae8767-0861-4954-83f3-11ad101f44a2%2FphpuMvO9I.png)
DATA STRUCTURE
b. [496] Write and explain the tightest big-O complexity of these two search algorithms. (The input data is a sorted array.) int linearsearch (int data [], int search) int i; for (i = 0; i< n; i++){ if (data[i] — search)< return i; return -1 int binarysearch (int data[], int search, int n)I int low 0, high n – 1; high){ int mid – (low + high) / 2; if (data[mid] search){ (low<Ξ while return
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured