Skip to content

improved statement #3

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
Hub-Abhi wants to merge 2 commits into
base: master
Choose a base branch
from
Open

improved statement #3

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4cbd5f6
Update Sort1.c
Hub-Abhi Oct 1, 2020
0b83588
Update Sort1.c
Hub-Abhi Oct 1, 2020
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
10 changes: 5 additions & 5 deletions Sort1.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,18 +24,18 @@ int binarySearch(int *arr, int l, int r)
{
int mid= (l + r)/2;
if (*(arr+mid)==1 && *(arr+mid-1)==0)
return mid;
return mid;
else if(*(arr+mid)==0 && *(arr+mid+1)==1)
return (mid+1);
else if (*(arr+mid)==1 && *(arr+mid-1)==1)
return binarySearch(arr, l, mid-1);
return binarySearch(arr, l, mid-1);
}
}
void printArray(int *arr, int n)
{
for(int i=0;i<n;i++)
printf("%d ",*(arr+i));
printf("\n");
printf("\n");
}
int main()
{
Expand All @@ -45,9 +45,9 @@ int main()
arr=(int*)malloc(n*sizeof(int));
printf("\nEnter the binary array elements: ");
for(i=0;i<n;i++)
scanf("%d",arr+i);
scanf("%d",arr+i);
insertionSort(arr, n);
printf("\nThe array elements:\n");
printf("\nThe array elements are:\n");
printArray(arr, n);
int result = binarySearch(arr, 0, n - 1);
printf("\nElement 1 is first present at index %d and at position %d.\n",result,result+1);
Expand Down