Scribd
Upload
6 views2 pages

ADA Program1

The document contains a C program that implements the binary search algorithm to find an element in a sorted array. It defines a function 'binarySearch' that returns the index of the element if found, or -1 if not present. The program also includes a main function that tests the binary search with a sample array and prints the result along with the time complexity of the algorithm, which is O(log n).

Uploaded by

sidduv337
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

ADA Program1

The document contains a C program that implements the binary search algorithm to find an element in a sorted array. It defines a function 'binarySearch' that returns the index of the element if found, or -1 if not present. The program also includes a main function that tests the binary search with a sample array and prints the result along with the time complexity of the algorithm, which is O(log n).

Uploaded by

sidduv337
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

#include <stdio.

h>

int binarySearch(int arr[], int l, int r, int x)


{
while (l <= r) {
int m = l + (r - l) / 2;

// Check if x is present at mid


if (arr[m] == x)
return m;

// If x greater, ignore left half


if (arr[m] < x)
l = m + 1;

// If x is smaller, ignore right half


else
r = m - 1;
}

// Element not present


return -1;
}

int main(void)
{
int arr[] = { 2, 3, 4, 10, 40 };
int n = sizeof(arr) / sizeof(arr[0]);
int x = 10;

int result = binarySearch(arr, 0, n - 1, x);

if (result == -1)
printf("Element is not present in array\n");
else
printf("Element is present at index %d\n", result);
printf("Time Complexity: O(log n)\n");

return 0;
}

You might also like