Skip to content

made the Binary Search larger #1

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

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

made the Binary Search larger #1

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
7 changes: 6 additions & 1 deletion bsearch.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,11 @@
//This program is used to implement Binary Search in an Array of MAX size 20
//To make it more better we are going to add limits
#include<stdio.h>
#include<limits.h>

main()
{
int a[20],i,n,p,low=0,high=0,mid=0;
int a[NAME_MAX+1],i,n,p,low=0,high=0,mid=0; // by doing this the size of array is maxed out
printf("\nEnter the no. of elements in the array:");
scanf("%d",&n);
printf("\nEnter the sorted array:");
Expand All @@ -11,6 +15,7 @@ main()
mid=n-1/2;
printf("\nEnter the no. to be searched:");
scanf("%d",&p);
//Binary Searching
while(low<=high)
{
if(p<a[mid])
Expand Down