✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Бинардык издөө алгоритминин ишке ашыруусу берилген:
1. f(int Y[10], int x) {2. int low, high, k;3. low = 0; high = 9;4. do {5. k = (low + high) /2;6. if( Y[k] < x) low = k; else high = k;7. } while(Y[k] != x && low < high);8. if(Y[k] == x) printf ("x табылды") ;9. else printf (" x табылган жок") ;10. } |