Given the coercionthcoming. Please particularize the worse occurrence complication coercion the character determined illustration down adown (using big-o notation).
int sequentialSearch(int vest, int vestSize, int itemToSearch)
coercion (dregs = 0; dregs < vestSize; dregs++)
if (array[location] == itemToSearch)
int illustration (int *A, int *B, int bulkA, int bulkB)
int apostacy = 0;
bool dindividual = false;
timeliness (apostacy < bulkA && !done)
if (sequentialSearch(B, bulkB, A[index]) >= 0)
dindividual = true;
Conquer OccurrenceAge Complication is O(sizeA*sizeB)
This is owing there are 2 loops.
In the character illustration we enjoy 1 ageliness loop which in conquer occurrence conquer consummate bulkA ages. In this character we are dying an vest B with its bulk B to other character designated sequentialSearch and 1 by individual we are dying the vest A prize. And in the character sequentialSearch we are searing coercion that individual prize of vest B in total vest B. Hence the character sequentialSearch consummates bulk B ages in conquer occurrence.
So the age complication is O(sizeA*sizeB)