[Solved]B 496 Write Explain Tightest Big O Complexity Two Search Algorithms Input Data Sorted Arra Q37156107

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 mid; else if (data [mid] > search){ high – mid – 1; else if (data mid]< search){ low = mid + 1; return -1; Show transcribed image text 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

Expert Answer

---

Answer to b. [496] Write and explain the tightest big-O complexity of these two search algorithms. (The input data is a sorted arr… . . .