C Program to Implement Sequential and Binary Search on Same Array

This C program Implements Sequential and Binary Search on Same Array.

Here is the source code of the C program to display search result using Sequential search and Binary search. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C program for binary search and the sequential search on

```
 * the same sorted array
```
```
 */
```
```
#include <stdio.h>
```
```
 
```
```
/* Function for sequential search  */
```

void sequential_search(int array[], int size, int n)

```
{
```
```
    int i;
```
```
    for (i = 0; i < size; i++)
```
```
    {
```
```
        if (array[i] == n)
```
```
        {
```

            printf("%d found at location %d.\n", n, i+1);

```
            break;
```
```
        }
```
```
    }
```
```
    if (i == size)
```

        printf("Not found! %d is not present in the list.\n", n);

```
}
```
```
/*  End of sequential_search()  */
```
```
 
```
```
/*  Function for binary search  */
```

void binary_search(int array[], int size, int n)

```
{
```
```
    int i, first, last, middle;
```
```
    first = 0;
```
```
    last = size - 1;
```
```
    middle = (first+last) / 2;
```
```
 
```
```
    while (first <= last) {
```
```
        if (array[middle] < n)
```
```
            first = middle + 1;
```
```
        else if (array[middle] == n) {
```

            printf("%d found at location %d.\n", n, middle+1);

```
           break;
```
```
        }
```
```
        else
```
```
            last = middle - 1;
```
```
 
```
```
        middle = (first + last) / 2;
```
```
    }
```
```
    if ( first > last )
```

        printf("Not found! %d is not present in the list.\n", n);

```
}
```
```
/*  End of binary_search()  */
```
```
 
```
```
/*  The main() begins  */
```
```
int main()
```
```
{
```
```
    int a[200], i, j, n, size;
```

    printf("Enter the size of the list:");

```
    scanf("%d", &size);
```

    printf("Enter %d Integers in ascending order\n", size);

```
    for (i = 0; i < size; i++)
```
```
        scanf("%d", &a[i]);
```
```
    printf("Enter value to find\n");
```
```
    scanf("%d", &n);
```
```
    printf("Sequential search\n");
```
```
    sequential_search(a, size, n);
```
```
    printf("Binary search\n");
```
```
    binary_search(a, size, n);
```
```
    return 0;
```
```
}
```

$ gcc search.c
$ a.out
Enter the size of the list:10
Enter 10 Integers in ascending order
2 5 8 12 16 25 31 45 48 55
Enter value to find
16
sequential search
16 found at location 5.
Binary search
16 found at location 5.

Sanfoundry Global Education & Learning Series – 1000 C Algorithms.

If you wish to look at all C Algorithms and Solutions, go to C Algorithms.

« Prev - Bucket Sort in C

» Next - C Program to Implement Locality of Reference in Link List

Related Posts:

Practice Computer Science MCQs
Practice BCA MCQs
Apply for C Internship
Apply for Computer Science Internship
Check C Books

Recommended Articles: