Home IT Linux Windows Database Network Programming Server Mobile  
  Home \ Programming \ Implement binary search algorithm in C language     - Nginx Keepalived Nginx monitoring scripts (Server)

- How to ensure that the Internet will not be attacked (Linux)

- By creating a personal technology blog Detailed GitHub (Linux)

- Linux Command Tutorial: Ubuntu apt-get command (Linux)

- linux remote control software (Linux)

- To install Emacs under CentOS 6.5 (Linux)

- to install the deployment of LVS under CentOS 7.0 (Server)

- How to release the cache memory on Linux (Linux)

- Linux ps command (Linux)

- MySQL 5.5 on master-slave copy filter (Database)

- VNC configuration detailed analysis under Linux (Linux)

- C ++ class implementation date operator overloading (Programming)

- Configuring automatic mail GAMIT under CentOS system (Linux)

- CentOS install SVN server configuration and automatically synchronized to the Web directory (Server)

- Embedded Linux to solve the problem in the time zone (Linux)

- Upgrading from Fedora 20 to 21 (Linux)

- impdp error ORA-39001, ORA-39000, ORA-31619 (Database)

- Protect against network attacks using Linux system firewall (Linux)

- ASM learning overview (Database)

- Ubuntu will be written in a command file, executable file, source command (Linux)

  Implement binary search algorithm in C language
  Add Date : 2018-11-21      
  Binary search algorithm thinking is very simple, it is an ordered sequence of binary search, where I use a binary search integer array order. If implemented in C, then we need to pay attention to the following aspects:

1. How to determine the lookup is completed, the return value is defined meanings, define exit loop condition

2. How to deal with border issues, such as 123 of this sequence, when we're looking for 1 or 3, it will make the program appear BUG

3. For the number of columns, we usually use plastic storage under standard, remove the standard binary search if the intermediate numbers, what kind of problem occurs? Whether these problems will affect our search, if the problem is how to avoid?

Typically, as a beginner, I think even a binary search is too simple, not worth mentioning, the recent reflection, binary search algorithm for the requirements of the theory is not very high, but if it is put into the feasibility of the program code , then we need to think about many of the details, otherwise write the code is error-prone.

How to solve the first problem, because we understand the idea of ​​binary search is actually a binary search, to have the left margin and right margin we can determine the intermediate element, when the left edge of the right boundary coincides with the time, then find the object becomes an element, if it is not to find an object request, then look in the collection will not have the required elements. So that we clearly define the parameters needed to come out, and quit the Find conditions. We need a left border and right border, as well as the middle element, if the right margin smaller (larger than the left and right) than the left margin when the loop exits, returns an exception. If not, perform a lookup statement.

Here's how to design it to find the statement, if combined with the second and third question, we can readily write the code:

while (left <= right)
    mid = (left + right) / 2;
    if (x> mid)
    left = mid;
    else if (x     right = mid;
    return mid;
return error;

Obviously doing so it is too good, according to the ideas of mathematics, this is simply not eligible borders, considering the C language will be automatically discarded plastic decimals, then the left boundary is entirely possible that we write but right boundary is never to take, if the intermediate value taken to a non-integer, it will affect other aspects of our search results, the answer is no, if discarded automatically generated status decimal, only to find only affect us in an ordered sequence of elements in a position to find the sub-segment length, and will not affect our search results, if you want to solve the border issue, we can make partial segment generated boundary shift, since the mid element has been judged too, so when we segment boundary segments can discard mid element, so that the border is mid + 1 or mid-1, and we will complete the binary search of an array of integers, codes are as follows:

#include // binary search algorithm that is the test case
int BinySerch (int * arr, int x, int lengh) // design parameters, as is the integer array, so we have to pass him
{// Array length downgrade occur when the Senate otherwise
int left = 0, right = lengh - 1;
int mid;
while (left <= right)
mid = left + (right - left) / 2;
if (x {
right = mid - 1;
else if (x> arr [mid])
left = mid + 1;
return mid;
return -1;
int main () // test case
int x = 0;
int arr [11] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int lengh = sizeof (arr) / sizeof (arr [0]);
for (int i = 0; i <12; i ++)
printf ( "% d", BinySerch (arr, i, lengh));
system ( "pause");
return 0;
- GitLab Installation Guide -Ubuntu 14.04 LTS (Server)
- When RHEL7 use fdisk partition, all partitions can not be used (Linux)
- Nginx Beginner Guide (Server)
- Linux file time Comments ctime mtime atime (Linux)
- CentOS and RHEL installation under GAMIT10.6 (Linux)
- Quickly build and install Linux KVM system (Linux)
- Android webView URL redirects affect goBack () (Programming)
- Linux 6 use UDEV binding shared storage (Linux)
- Python Flask environment to build (Linux)
- HomeKit User Interface Guidelines (Linux)
- Switching Virtual Machine + Ubuntu graphical interface and terminal interface (Linux)
- Beautiful start Ubuntu installation tool Duck Launcher 0.64.5 (Linux)
- Linux, Chrome browser font settings beautification (Linux)
- Java thread lifecycle (Programming)
- Ubuntu 15.10 15.04 14.10 14.04 Install Ubuntu Tweak (Linux)
- Using the Android interface in Parcelable (Programming)
- Linux Operating System Security Study (Linux)
- Linux 101 hack book reading notes (Linux)
- Construction Spark source and application development environment (Server)
  CopyRight 2002-2016 newfreesoft.com, All Rights Reserved.