Який алгоритм пошуку реалізовано у коді? int search(int A[], int first, int last, int key) { if (last<first) return -1; int mid = (first + last) / 2; if (key==A[mid]) return mid; else if (key<A[mid]) return search(A, first, mid – 1, key); else return search(A, mid + 1, last, key); }

Кнута-Морріса-Пратта

Crowdly

Add to Chrome

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Який алгоритм пошуку реалізовано у коді?

int search(int

A[],

int

first,

int

last, int

key)

{

(last<first) return

-1;

int

mid =

(first

+ last)

(key==A[mid])

return mid;

else

(key<A[mid])

return search(A,

first,

mid –

key);

else

return search(A,

mid +

last,

key);

}

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome