Code in C. Solve the code below. write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int busca_bin (int vetor [ ], int n, int b) { #include     int busca_bin(int vetor[] , int n , int a) {    int s1 = 0; int s2 = n-1; int pass = 0; int s3;        while(s1a)             s2 = s3 - 1;         else             s1 = s3 + 1;     }            return 0;

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Code in C. Solve the code below.

write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin".

int busca_bin (int vetor [ ], int n, int b)
{

#include <stdio.h>

 

 

int busca_bin(int vetor[] , int n , int a)

{

  

int s1 = 0;

int s2 = n-1;

int pass = 0;

int s3;

  

    while(s1<s2)

    {

        s3 = (s1+s2)/2;

        pass++;

       

        if(vetor[s3]==a)

            return pass;

        else if(vetor[s3]>a)

            s2 = s3 - 1;

        else

            s1 = s3 + 1;

    }   

   

    return 0;

}

 

Precheck only
Test
Input Expected Got
int vetor[]={1,2,3,4,5}, n=5, b, x; 3
1
1
scanf("%d", &b);
x=busca_bin(vetor,n,b);
printf("%d", x);
int vetor[]={1,2,3,4,5}, n=5, b, x; 5
scanf("%d",&b);
x=busca_bin(vetor,n,b);
printf("%d",x);
int vetor[]={1,2,3,4,5}, n=5, b, x; 6
scanf("%d", &b);
x=busca_bin(vetor,n,b);
printf("%d",x);
>
>
3.
Transcribed Image Text:Precheck only Test Input Expected Got int vetor[]={1,2,3,4,5}, n=5, b, x; 3 1 1 scanf("%d", &b); x=busca_bin(vetor,n,b); printf("%d", x); int vetor[]={1,2,3,4,5}, n=5, b, x; 5 scanf("%d",&b); x=busca_bin(vetor,n,b); printf("%d",x); int vetor[]={1,2,3,4,5}, n=5, b, x; 6 scanf("%d", &b); x=busca_bin(vetor,n,b); printf("%d",x); > > 3.
For example:
Test
Input Result
int vetor[]={1,2,3,4,5}, n=5, b, x; 3
scanf("%d" , &b);
x=busca_bin(vetor,n,b);
printf("%d",x);
int vetor[]={1,2,3,4,5}, n=5, b, x; 5
3
scanf("%d", &b);
x=busca_bin(vetor,n,b);
printf("%d", x);
int vetor[]={1,2,3,4,5}, n=5, b, x; 6
scanf ("%d", &b);
x=busca_bin(vetor,n,b);
printf("%d", x);
Transcribed Image Text:For example: Test Input Result int vetor[]={1,2,3,4,5}, n=5, b, x; 3 scanf("%d" , &b); x=busca_bin(vetor,n,b); printf("%d",x); int vetor[]={1,2,3,4,5}, n=5, b, x; 5 3 scanf("%d", &b); x=busca_bin(vetor,n,b); printf("%d", x); int vetor[]={1,2,3,4,5}, n=5, b, x; 6 scanf ("%d", &b); x=busca_bin(vetor,n,b); printf("%d", x);
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY