\n Binary search is an algorithm for finding a specific value in a sorted array. It works by comparing the middle value of the array and halving the search range.
\n The time complexity of binary search is O(log n), making it very efficient. Let’s understand the principles of this algorithm by implementing it in practice.\n <\/p>\n
\n The following problem involves finding a specific number using binary search:\n <\/p>\n
\n \n \/\/ Problem: Find a specific number in the given integer array.\n \/\/ The array is sorted in ascending order.\n \/\/ If the number is found, return its index, \n \/\/ and return -1 if it is not found.\n <\/code>\n <\/pre>\nExample Input<\/h3>\n\n- Input Array: [2, 3, 4, 10, 40]<\/li>\n
- Value to Find: 10<\/li>\n<\/ul>\n
Example Output<\/h3>\n\n- Output: 3 (10 is located at index 3)<\/li>\n<\/ul>\n
3. Problem Solving Strategy<\/h2>\n
\n The basic idea of binary search is as follows:\n <\/p>\n
\n- Select the middle element of the array.<\/li>\n
- Compare the middle element with the value to be found.<\/li>\n
- If the value to be found is less than the middle element, reduce the search range to the left half of the array.<\/li>\n
- If the value to be found is greater than the middle element, reduce the search range to the right half of the array.<\/li>\n
- Repeat this process until the value to be found is found.<\/li>\n<\/ul>\n
4. Algorithm Implementation<\/h2>\n
\n Now let’s implement the binary search algorithm in C#. The following code is an implementation of the binary search algorithm that finds a specific value in the given array.\n <\/p>\n
\n \n using System;\n\n class Program\n {\n static int BinarySearch(int[] arr, int target)\n {\n int left = 0;\n int right = arr.Length - 1;\n\n while (left <= right)\n {\n int mid = left + (right - left) \/ 2;\n\n \/\/ Compare mid value with the target value\n if (arr[mid] == target)\n {\n return mid; \/\/ Return index if the value is found\n }\n else if (arr[mid] < target)\n {\n left = mid + 1; \/\/ Search in the right half of the array\n }\n else\n {\n right = mid - 1; \/\/ Search in the left half of the array\n }\n }\n\n return -1; \/\/ Case when the value is not found\n }\n\n static void Main(string[] args)\n {\n int[] arr = { 2, 3, 4, 10, 40 };\n int target = 10;\n int result = BinarySearch(arr, target);\n\n if (result == -1)\n {\n Console.WriteLine(\"The value to be found does not exist.\");\n }\n else\n {\n Console.WriteLine(\"Index of the value to be found: \" + result);\n }\n }\n }\n <\/code>\n <\/pre>\n5. Code Explanation<\/h2>\n
\n Let's take a closer look at how binary search is implemented in the C# code above.\n <\/p>\n
\nBinarySearch<\/code> method takes two parameters: an integer array arr<\/code> and the value to be found target<\/code>.<\/li>\n- The variable
left<\/code> stores the starting index of the array, and right<\/code> stores the ending index of the array.<\/li>\n- The loop
while (left <= right)<\/code> continues as long as there is a search range left.<\/li>\n- The middle index is calculated as
int mid = left + (right - left) \/ 2;<\/code>. This is one way to prevent index overflow in large arrays.<\/li>\n- By comparing the mid value with the target value, we modify the value of
left<\/code> or right<\/code> based on the conditions.<\/li>\n- If the target value is found, the corresponding index is returned, and -1 is returned if the target value is not found.<\/li>\n<\/ul>\n
6. Time Complexity<\/h2>\n
\n The time complexity of binary search is O(log n). This is because the data is halved during the search process.
\n Even if n is a very large number, binary search can derive the result with relatively few comparisons.\n <\/p>\n
7. Conclusion<\/h2>\n
\n The binary search algorithm operates very efficiently when the data is sorted.
\n By understanding and implementing this algorithm well, it will be very helpful in various coding tests and development tasks.
\n I hope you enhance your skills in binary search by solving algorithm problems.\n <\/p>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"