Its core working principle involves dividing the data in the list to half until the required value is located and displayed to the user in the search result. A Binary Search is a sorting algorithm, that is used to search an element in a sorted array. Its core working principle involves dividing the data in the list to half until the required value is located and displayed to the user in the search result. I hope you found this informative and helpful, stay tuned for more tutorials on similar topics.You may also checkout our training program to get in-depth knowledge on jQuery along with its various applications, you can enroll here for live online training with 24/7 support and lifetime access. In the function, it performs binary search recursively. In Binary search, we start by examining the target value with the element in the middle of the array. In this procedure, the entire list is divided into two sub-lists. // Binary Search in C // ----codescracker.com----- #include #include int main() { int i, arr[10], search, first, last, middle; printf("Enter 10 elements (in ascending order): "); for(i=0; i<10; i++) scanf("%d", &arr[i]); printf("\nEnter element to be search: "); scanf("%d", &search); first = 0; last = 9; middle = (first+last)/2; while(first <= last) { if(arr[middle]