Binary search program in c#.net

Now we implement both searching techniques in C. Here, we use the array with initial values for searching the target element. The user will provide the value of the target element.

In the following code, the function LinearSearch performs the searching and returns the position of the target element if it is present and otherwise returns a value of In fact, the loop within this function compares each element with the target until the target is found or the entire array is scanned. This searching technique requires the list of elements to be sorted. Further, this function computes the mid-value of the index range and compares it with the target element, and updates this mid-value according to the method described earlier.

Here also the index of the target element is returned if it is present in the array or -1 is returned otherwise. The keys matching in step 1 means, a matching element has been found and its index or position is returned. Else step 3 or 4. If the search key is less than the middle element, then the algorithm repeats its action on the sub-array to the left of the middle element or,. If the search key is greater than the middle element, then the algorithm repeats its action on the sub-array to the right of the middle element.

Binary search, also known as half-interval search, is one of the common search algorithms that find the position of a value within a sorted array. The search algorithm looks for a value in a sorted array and starts at the middle element and compares the value with the item of the array. If the value is less than the element, search moves to the left side and starts at the middle element of the array. If the value is greater than the element, search moves to the right side and starts at the middle element of the array.

The Array class in. NET framework supports several methods to search, sort, and reverse array items. BinarySearch method searches an an array of elements for the given element and returns the postion of the element found in the array. View All. Display list1 ;. Sort 1, i, gg ;. Output: Original List 15 4 2 9 5 7 6 8 10 Sort a range with the alternate comparer 15 2 4 5 6 7 8 9 10 BinarySearch a range and Insert 3 15 2 3 4 5 6 7 8 9 Previous How to sort a list in C List.

Sort Method Set Next How to use Array. BinarySearch Method in C Set Recommended Articles. Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide. Load Comments. What's New. Most popular in C. More related articles in C.