Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update binary_search.c #2

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update binary_search.c #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions ADT/binary_search.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,19 +7,19 @@ int search(int a[],int size, int element )
while (start<=last)
{


//logic to binary search

if (a[mid]==element)
{
return mid;
}
if (a[mid]<element)
if (element<a[mid])
{
start = mid+1;
start = mid-1;
}
else
{
start = mid-1;
start = mid+1;
}


Expand All @@ -29,7 +29,7 @@ int search(int a[],int size, int element )
};
int main()
{ int temp = 0,i;
int a[ ]= {11,12,13,14,22,209 };
int a[ ]= {11,12,13,14,22,209 }; //Array must be sorted
int size= sizeof(a)/sizeof(int);
int element, start=0 , last= 5 ;
printf("array is \t");
Expand All @@ -46,4 +46,4 @@ int main()


return 0;
}
}