OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

modify other_binary_search

Browse Source
This commit is contained in:
koseokkyu 2017-11-20 16:08:47 +09:00
parent 04527dfc56
commit c3bd560d4c
1 changed files with 37 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
Searches/Other_Binary_Search.c
View File

@ -2,27 +2,27 @@
#include <stdlib.h>
#define len 5
int binarySearch(int array[] , int len , int searchX)
{
int pos = -1 , right , left , i = 0;
int binarySearch(int array[], int leng, int searchX)
{
int pos = -1, right, left, i = 0;
left = 0;
right = len - 1;
right = leng - 1;
for(i = 0; i < len ; i++)
for (i = 0; i < leng; i++)
{
pos = (left + right)/2;
pos = (left + right) / 2;
if(array[pos] == searchX)
if (array[pos] == searchX)
return pos;
else
{
if(array[pos] < searchX)
right = pos - 1;
if (array[pos] < searchX)
left = pos + 1;
else
{
left = pos + 1 ;
right = pos - 1;
}
}
}
@ -32,18 +32,18 @@ int binarySearch(int array[] , int len , int searchX)
}
void main(int argc , char *argv[])
void main(int argc, char *argv[])
{
int array[len] = { 5, 8 , 10 , 14 ,16};
int array[len] = { 5, 8 , 10 , 14 ,16 };
int position;
position = binarySearch(array , len , 5);
position = binarySearch(array, len, 5);
if( position < 0)
printf("The number %d doesnt exist in array\n",5);
if (position < 0)
printf("The number %d doesnt exist in array\n", 5);
else
{
printf("The number %d exist in array at position : %d \n",5,position);
printf("The number %d exist in array at position : %d \n", 5, position);
}