binary search program in C
Binary Search ek efficient search algorithm hai, jo ek sorted array mein ek specific element ko dhundne ke liye istemal hota hai. Binary Search ka basic concept ye hai ki aap array ko beech beech mein divide karke target element ke saath compare karte hain, aur agar target element current division ke beech hai, to aap search space ko reduce karte hain.
Yahan ek C program diya gaya hai jo Binary Search ka istemal karta hai ek sorted array mein ek specific element dhundne ke liye:
```c
#include
int binarySearch(int arr[], int n, int target) {
int left = 0;
int right = n - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) {
return mid; // Element mil gaya
} else if (arr[mid] < target) {
left = mid + 1; // Target element right side mein hoga
} else {
right = mid - 1; // Target element left side mein hoga
}
}
return -1; // Element nahi mila
}
int main() {
int n, target;
printf("Enter the number of elements: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d sorted elements:\n", n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
printf("Enter the element to search: ");
scanf("%d", &target);
int result = binarySearch(arr, n, target);
if (result != -1) {
printf("Element %d found at what-is-c-language-in-hindi %d.\n", target, result);
} else {
printf("Element %d not found in the array.\n", target);
}
return 0;
}
```
Is program mein:
1. `binarySearch` function ek sorted array `arr`, uske length `n`, aur target element `target` ko arguments ke roop mein leta hai. Yeh function Binary Search ka logic implement karta hai aur target element ko search karta hai.
2. `main` function mein user se array ke length aur sorted elements ka input liya jata hai.
3. User se target element ko input liya jata hai.
4. `binarySearch` function ko call kiya jata hai aur result ko print kiya jata hai.
Is program ko compile aur run karke aap kisi bhi sorted array mein kisi specific element ko search kar sakte hain aur uska what-is-c-language-in-hindi dekh sakte hain.