Skip to content

required changes #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
RiddhiGope2002 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

required changes #1

Show file tree
Hide file tree
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
Binary file added Quicksort.exe
View file
Open in desktop
Binary file not shown.
132 changes: 66 additions & 66 deletions binary search.c → binary-search.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,66 +1,66 @@
#include<stdio.h>
int main()
{
int a[100],n,i;
printf("\n Enter no. of elements : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
//Arrange array in ascending order.
int temp,j;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\n array in asc. order is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n");
//Binary search code.
int l=0,h=n-1,m=(l+h)/2; //l,h,m contain indexes.
int e,flag;
printf("\n Enter element to search : ");
scanf("%d",&e);
while(l<=h)
{
if(e==a[m])
{
flag=1;
break;
}
else if(e>a[m])
{
l=m+1;
m=(l+h)/2;
}
else if(e<a[m])
{
h=m-1;
m=(l+h)/2;
}
}
if(flag==1)
{
printf("\n Element if found.");
printf("\n Position of element in sorted array is %d.",m+1);
}
else
printf("\n element is not in array.");
printf("\n\n")
return 0
}
#include<stdio.h>
int main()
{
int a[100],n,i;
printf("\n Enter no. of elements : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
//Arrange array in ascending order.
int temp,j;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\n array in asc. order is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n");
//Binary search code.
int l=0,h=n-1,m=(l+h)/2; //l,h,m contain indexes.
int e,flag;
printf("\n Enter element to search : ");
scanf("%d",&e);
while(l<=h)
{
if(e==a[m])
{
flag=1;
break;
}
else if(e>a[m])
{
l=m+1;
m=(l+h)/2;
}
else if(e<a[m])
{
h=m-1;
m=(l+h)/2;
}
}
if(flag==1)
{
printf("\n Element if found.");
printf("\n Position of element in sorted array is %d.",m+1);
}
else
printf("\n element is not in array.");

printf("\n\n");

return 0;
}
Binary file added binary-search.exe
View file
Open in desktop
Binary file not shown.
66 changes: 33 additions & 33 deletions bubble sort.c → bubble-sort.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,33 +1,33 @@
#include<stdio.h>
int main()
{
int a[100],n,i;
printf("\n Enter the size of array : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",a[i]);
}
int j,temp;
//bubble sort code.
for(i=0;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\n Your sorted array is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n\n")
return 0
}
#include<stdio.h>
int main()
{
int a[100],n,i;
printf("\n Enter the size of array : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",a[i]);
}
int j,temp;
//bubble sort code.
for(i=0;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\n Your sorted array is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n\n");
return 0;
}
Binary file added bubble-sort.exe
View file
Open in desktop
Binary file not shown.
2 changes: 2 additions & 0 deletions cyclicsort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
#include<bits/stdc++.h>
#include<iostream>
using namespace std;

int swap(int arr[],int first,int second){
Expand Down Expand Up @@ -35,4 +36,5 @@ int main(){
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
return 0;
}
Binary file added cyclicsort.exe
View file
Open in desktop
Binary file not shown.
66 changes: 33 additions & 33 deletions insertion sort.c → insertion-sort.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,33 +1,33 @@
#include<stdio.h>
int main()
{
int a[100],i,n;
printf("\n Enter no. of elements : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int temp,j;
//insertion sort code.
for(i=1;i<n;i++)
{
temp=a[i];
for(j=i-1;j>=0;j--)
{
if(temp<a[j]) //ascending order.
{
a[j+1]=a[j]; //shift greater value to next index.
a[j]=temp;
}
}
}
printf("\n Your array in asc. order is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n\n")
return 0;
}
#include<stdio.h>
int main()
{
int a[100],i,n;
printf("\n Enter no. of elements : ");
scanf("%d",&n);
printf("\n Enter array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int temp,j;
//insertion sort code.
for(i=1;i<n;i++)
{
temp=a[i];
for(j=i-1;j>=0;j--)
{
if(temp<a[j]) //ascending order.
{
a[j+1]=a[j]; //shift greater value to next index.
a[j]=temp;
}
}
}
printf("\n Your array in asc. order is : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n\n");
return 0;
}
58 changes: 29 additions & 29 deletions linear searching.c → linear-searching.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,29 +1,29 @@
#include<stdio.h>
int main()
{
int a[1000],n,i,e;
printf("\n Enter number of elements : ");
scanf("%d",&n);
printf("\n Enter the array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n Enter element to search : ");
scanf("%d",&e);
for(i=0;i<n;i++)
{
if(e==a[i])
{
printf("\n Element is found.");
printf("\n position of element in array is : %d",i+1);
break;
}
if(i==(n-1))
{
printf("\n Element not found in the array!!");
}
}
printf("\n\n");
return 0;
}
#include<stdio.h>
int main()
{
int a[1000],n,i,e;
printf("\n Enter number of elements : ");
scanf("%d",&n);
printf("\n Enter the array : ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n Enter element to search : ");
scanf("%d",&e);
for(i=0;i<n;i++)
{
if(e==a[i])
{
printf("\n Element is found.");
printf("\n position of element in array is : %d",i+1);
break;
}
if(i==(n-1))
{
printf("\n Element not found in the array!!");
}
}
printf("\n\n");
return 0;
}
Loading