Add Account

@anonymous · Jul 3, 2022 · edited: Jul 4, 2022
binary search
#include<stdio.h>
int fnBinSearch(int A[], int k, int iLow,int iHigh);
int main(void)
{
int iaArr[20],iNum,iKey;
int i,iPos=0;
printf("\nEnter the size of the array\n");
scanf("%d",&iNum);
printf("\nEnter the elements of the array in ascending order:\n");
for(i=0;i<iNum;i++)
scanf("%d",&iaArr[i]);
printf("\nenter the key element\n");
scanf("%d",&iKey);
iPos=fnBinSearch(iaArr,iKey,0,iNum-1);
if(iPos==-1)
printf("\nElement not found\n");
else
printf("\nElement found at position %d\n",iPos+1);
return 0;
}
int fnBinSearch(int A[], int k, int iLow,int iHigh)
{
int iMid;
if(iLow<=iHigh)
{
iMid=(iLow+iHigh)/2;
if(k==A[iMid])
return iMid;
if(k<A[iMid])
return fnBinSearch(A,k,iLow,iMid-1);
if(k>A[iMid])
return fnBinSearch(A,k,iMid+1,iHigh);
}
else
return -1;
}
to find max and min num
#include <stdio.h>
#include <stdlib.h>
void fnRecMaxMin(int [], int , int, int*, int*);
int main( int argc, char **argv)
{
int iaArr[500000],iNum,i;
int iMax=0,iMin=0;
printf("\nEnter the size of the array\n");
scanf("%d",&iNum);
printf("\nEnter the elements of the array:\n");
for(i=0;i<iNum;i++)
scanf("%d",&iaArr[i]);
fnRecMaxMin(iaArr, 0, iNum-1, &iMax, &iMin);
printf("\nMax Element = %d\nMin Element = %d\n", iMax, iMin);
return 0;
}
void fnRecMaxMin(int a[],int low,int high, int *max, int *min)
{
int mid,max1,max2,min1,min2;
if(high-low == 1)
{
if(a[low] > a[high])
{
*max = a[low];
*min = a[high];
}
else
{
*max = a[high];
*min = a[low];
}
}
else if(low == high)
{
*min = *max = a[low];
}
else if(low<high)
{
mid=(low+high)/2;
fnRecMaxMin(a,low,mid,&max1,&min1);
fnRecMaxMin(a,mid+1,high,&max2,&min2);
if(max1 > max2)
*max = max1;
else
*max = max2;
if(min1 < min2)
*min = min1;
else
*min = min2;
}
Merege sort
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <time.h>
void fnGenRandInput(int [], int);
void fnDispArray( int [], int);
void fnMerge(int [], int ,int ,int);
void fnMergeSort(int [], int , int);
int main( int argc, char **argv)
{
FILE *fp;
struct timeval tv;
double dStart,dEnd;
int iaArr[500000],iNum,iPos,iKey,i,iChoice;
for(;;)
{
printf("\n1.Plot the Graph\n2.MergeSort\n3.Exit");
printf("\nEnter your choice\n");
scanf("%d",&iChoice);
switch(iChoice)
{
case 1:
fp = fopen("MergePlot.dat","w");
for(i=100;i<100000;i+=100)
{
fnGenRandInput(iaArr,i);
gettimeofday(&tv,NULL);
dStart = tv.tv_sec + (tv.tv_usec/1000000.0);
fnMergeSort(iaArr,0,i-1);
gettimeofday(&tv,NULL);
dEnd = tv.tv_sec + (tv.tv_usec/1000000.0);
fprintf(fp,"%d\t%lf\n",i,dEnd-dStart);
}
fclose(fp);
printf("\nData File generated and stored in file <MergePlot.dat >.\n Use a plotting utility\n");
break;
case 2:
printf("\nEnter the number of elements to sort\n");
scanf("%d",&iNum);
printf("\nUnsorted Array\n");
fnGenRandInput(iaArr,iNum);
fnDispArray(iaArr,iNum);
fnMergeSort(iaArr,0,iNum-1);
printf("\nSorted Array\n");
fnDispArray(iaArr,iNum);
break;
case 3:
exit(0);
}
}
return 0;
}
void fnMerge(int a[], int low,int mid,int high)
{
int i,k,j,b[500000];
i=k=low;
j=mid+1;
while(i<=mid && j<=high)
{
if(a[i]<a[j])
b[k++]=a[i++];
else
b[k++]=a[j++];
}
while(i<=mid)
b[k++]=a[i++];
while(j<=high)
b[k++]=a[j++];
for(i=low;i<k;i++)
a[i]=b[i];
}
void fnMergeSort(int a[],int low,int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
fnMergeSort(a,low,mid);
fnMergeSort(a,mid+1,high);
fnMerge(a,low,mid,high);
}
}
void fnGenRandInput(int X[], int n)
{
int i;
srand(time(NULL));
for(i=0;i<n;i++)
{
X[i] = rand()%10000;
}
}
void fnDispArray( int X[], int n)
{
int i;
for(i=0;i<n;i++)
printf(" %5d \n",X[i]);
}
quick sort
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <time.h>
void fngenrandinput(int [],int);
void fndisparray(int [],int);
int fnpartition(int [],int,int);
void fnquicksort(int [],int,int);
void fnswap(int*,int*);
void fnswap(int *a,int *b)
{
int t = *a;
*a = *b;
*b = t;
}
int main(int argc,char **argv)
{
FILE *fp;
struct timeval tv;
double dstart,dend;
int iaArr[500000],inum,ipos,i,ichoice;
for(;;)
{
printf("\n1 : Plot a graph\n2 : Quicksort\n3 : Exit");
printf("\nEnter your choice : ");
scanf("%d",&ichoice);
switch(ichoice)
{
case 1 : fp = fopen("quickplot.dat","w");
for(i=100;i<100000;i += 100)
{
fngenrandinput(iaArr,i);
gettimeofday(&tv,NULL);
dstart = tv.tv_sec + (tv.tv_usec/1000000.0);
fnquicksort(iaArr,0,i-1);
gettimeofday(&tv,NULL);
dend = tv.tv_sec + (tv.tv_usec/1000000.0);
fprintf(fp,"%d\t%lf\n",i,dend-dstart);
}fclose(fp);
printf("\nData File generated and stored in file <quickplot.dat>.\nuse a plotting utility");
break;
case 2 : printf("\nEnter the numbers of elements to sort : ");
scanf("%d",&inum);
printf("\nUnsorted Array \n");
fngenrandinput(iaArr,inum);
fndisparray(iaArr,inum);
fnquicksort(iaArr,0,inum-1);
printf("\nSorted Array\n");
fndisparray(iaArr,inum);
break;
case 3 : exit(0);
}
}
return 0;
}
int fnpartition(int a[],int l,int r)
{
int i,j,temp;
int p;
p = a[l];
i = l;
j = r+1;
do
{
do{i++;}while(a[i]<p);
do{j--;}while(a[j]>p);
fnswap(&a[i],&a[j]);
}while(i<j);
fnswap(&a[i],&a[j]);
fnswap(&a[l],&a[j]);
return j;
}
void fnquicksort(int a[],int l,int r)
{
int s;
if(l<r)
{
s = fnpartition(a,l,r);
fnquicksort(a,l,s-1);
fnquicksort(a,s+1,r);
}
}
void fngenrandinput(int X[],int n)
{
int i;
srand(time(NULL));
for(i=0;i<n;i++)
X[i] = rand() % 10000;
}
void fndisparray(int X[],int n)
{
int i;
for(i=0;i<n;i++)
printf(" %5d \n",X[i]);
}
heap sort
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <time.h>
void fnGenRandInput(int [], int);
void fnDispArray( int [], int);
void fnMaxHeapify(int[],int,int);
void fnBuildMaxHeap(int[],int);
void fnHeapSort(int[],int);
int main(void)
{
FILE *fp;
struct timeval tv;
double dStart,dEnd;
int iaArr[500000],iNum,iPos,iKey,i,iChoice;
for(;;)
{
printf("\n1.Plot the Graph\n2.HeapSort\n3.Exit");
printf("\nEnter your choice\n");
scanf("%d",&iChoice);
switch(iChoice)
{
case 1:
fp = fopen("HeapPlot.dat","w");
for(i=100;i<100000;i+=100)
{
fnGenRandInput(iaArr,i);
gettimeofday(&tv,NULL);
dStart = tv.tv_sec + (tv.tv_usec/1000000.0);
fnHeapSort(iaArr,i);
gettimeofday(&tv,NULL);
dEnd = tv.tv_sec + (tv.tv_usec/1000000.0);
fprintf(fp,"%d\t%lf\n",i,dEnd-dStart);
}
fclose(fp);
printf("\nData File generated and stored in file < HeapPlot.dat>.\n Use a plotting utility\n");
break;
case 2:
printf("\nEnter the number of elements to sort\n");
scanf("%d",&iNum);
printf("\nUnsorted Array\n");
fnGenRandInput(iaArr,iNum);
fnDispArray(iaArr,iNum);
fnHeapSort(iaArr,iNum);
printf("\nSorted Array\n");
fnDispArray(iaArr,iNum);
break;
case 3:
exit(0);
}
}
return 0;
}
void fnMaxHeapify(int a[],int i,int n)
{
int l,r,largest,temp;
l=2*i;
r=(2*i)+1;
if((l<=n)&& (a[l]>a[i]))
{
largest=l;
}
else
largest=i;
if((r<=n)&&(a[r]>a[largest]))
largest=r;
if(largest!=i)
{
temp=a[i];
a[i]=a[largest];
a[largest]=temp;
fnMaxHeapify(a,largest,n);
}
}
void fnBuildMaxHeap(int a[],int n)
{
int i;
for(i=n/2;i>=1;i--)
fnMaxHeapify(a,i,n);
}
void fnHeapSort(int a[],int n)
{
int temp,i;
fnBuildMaxHeap(a,n);
for(i=n;i>=2;i--)
{
temp=a[1];
a[1]=a[i];
a[i]=temp;
fnMaxHeapify(a,1,i-1);
}
}
void fnGenRandInput(int X[], int n)
{
int i;
srand(time(NULL));
for(i=1;i<=n;i++)
{
X[i] = rand()%10000;
}
}
void fnDispArray( int X[], int n)
{
int i;
for(i=1;i<=n;i++)
printf(" %5d \n",X[i]);
}
4B INSERTION
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <time.h>
void fnGenRandInput(int [], int);
void fnDispArray( int [], int);
void fnInsertionSort(int [], int);
int main(void)
{
FILE *fp;
struct timeval tv;
double dStart,dEnd;
int iaArr[100000],iNum,iPos,iKey,i,iChoice;
for(;;)
{
printf("\n1.Plot the Graph\n2.InsertionSort\n3.Exit");
printf("\nEnter your choice\n");
scanf("%d",&iChoice);
switch(iChoice)
{
case 1:
fp = fopen("InsertionPlot.dat","w");
for(i=100;i<10000;i+=100)
{
fnGenRandInput(iaArr,i);
gettimeofday(&tv,NULL);
dStart = tv.tv_sec + (tv.tv_usec/1000000.0);
fnInsertionSort(iaArr,i);
gettimeofday(&tv,NULL);
dEnd = tv.tv_sec + (tv.tv_usec/1000000.0);
fprintf(fp,"%d\t%lf\n",i,dEnd-dStart);
}
fclose(fp);
printf("\nData File generated and stored in file <InsertionPlot.dat >.\n Use a plotting utility\n");
break;
case 2:
printf("\nEnter the number of elements to sort\n");
scanf("%d",&iNum);
printf("\nUnsorted Array\n");
fnGenRandInput(iaArr,iNum);
fnDispArray(iaArr,iNum);
fnInsertionSort(iaArr,iNum);
printf("\nSorted Array\n");
fnDispArray(iaArr,iNum);
break;
case 3:
exit(0);
}
}
return 0;
}
void fnInsertionSort(int A[], int n)
{
int i, j, iKey;
for(i=1;i<n;i++)
{
iKey = A[i];
j = i-1;
while(j>=0 && A[j] > iKey)
{
A[j+1] = A[j];
j--;
}
A[j+1] = iKey;
}
}
void fnGenRandInput(int X[], int n)
{
int i;
srand(time(NULL));
for(i=0;i<n;i++)
{
X[i] = rand()%10000;
}
}
void fnDispArray( int X[], int n)
{
int i;
for(i=0;i<n;i++)
printf(" %5d \n",X[i]);
}
DFS
#include <stdio.h>
#include<stdlib.h>
const int MAX = 100;
void fnDepthFirstSearch(int currentVertex, int v[MAX], int g[MAX][MAX], int n);
int main(void)
{
int i,j,k;
int visited[MAX];
int graph[MAX][MAX];
int numVert, Vert;
printf("Enter the number of vertices : ");
scanf("%d",&numVert);
for (i=0; i<numVert; i++)
visited[i] = 0;
printf("Enter the adjacency matrix :\n");
for (i=0; i<numVert; i++)
for (j=0; j<numVert; j++)
scanf("%d",&graph[i][j]);
printf("Enter the source vertex : ");
scanf("%d",&Vert);
fnDepthFirstSearch(Vert,visited,graph,numVert);
for (k=0; k<numVert; k++)
{
if(visited[k])
{
printf("\nVertex %d reachable ",k+1);
}
else
{
printf("\nVertex %d not reachable ",k+1);
}
}
return 0;
}
void fnDepthFirstSearch(int currentVertex, int v[MAX], int g[MAX][MAX], int n)
{
int i;
v[currentVertex] = 1;
for (i=0; i<n; i++)
{
if (g[currentVertex][i] && !v[i])
fnDepthFirstSearch(i,v,g,n);
}
}
BFS
#include<stdio.h>
int a[6][6],n,start,visited[6];
void BFS();
void main()
{int i,j;
printf("\n Enter the number of vertices:");
scanf("%d",&n);
printf("\n Enter the adjacency matrix:");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
printf("\n Enter the starting vertex:");
scanf("%d",&start);
printf("\n the vertices or nodes reachable from %d are:\n",start);
BFS();
}
void BFS()
{
int q[6],r=-1,f=-1,i,j;
i=start;
for(i=1;i<=n;i++)
visited[i]=0;
visited[start]=1;
q[++r]=start;
f++;
do
{i=q[f++];
for(j=1;j<=n;j++)
if(a[i][j]&&visited[j]==0)
{printf("\n %d ",j);
visited[j]=1;
q[++r]=j;
}
}while(f<=r);
return;
}
TOPOLOGY
/* topological sorting*/
#include<stdio.h>
int a[6][6],s[6],n,top=-1,pos[6],count=0,vertex[6];
void push(int);
int pop();
int isempty();
int begin(int);
int next(int);
int topo();
void main()
{int i,j;
printf("\n Enter the number of vertices:");
scanf("%d",&n);
printf(" \n Enter the adjacency matrix");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
if(topo())
{printf("\n TOPO SEQ IS:\n");
for(i=1;i<=n;i++)
printf("\n %d",vertex[i]);
}
else
printf("\n TOPT SEQ DOESNOT EXIST:");
}
int pop()
{return s[top--];}
void push(int x)
{s[++top]=x;}
int isempty()
{if(top==-1)return 1;
return 0;
}
int begin(int v)
{int i;
for(i=1;i<=n;i++)
if(a[v][i]!=0)
{pos[v]=i;
return i;
}
pos[v]=n+1;
return 0;
}
int next(int v)
{int i;
for(i=pos[v]+1;i<=n;i++)
if(a[v][i]!=0)
{pos[v]=i;
return i;
}
pos[v]=n+1;
return 0;
}
int topo()
{
int Indegree[6],i,w,u;
for(i=1;i<=n;i++)
Indegree[i]=0;
for(i=1;i<=n;i++)
{
w=begin(i);
while(w)
{Indegree[w]++;
w=next(i);
}
}
for(i=1;i<=n;i++)
if(!Indegree[i])
push(i);
while(!isempty())
{u=pop();
vertex[++count]=u;
w=begin(u);
while(w)
{Indegree[w]--;
if(!Indegree[w])push(w);
w=next(u);
}
}
if(count==n)
return 1;
return 0;
}
45 visits · 2 online
Share
Vote: 0 0
0 Save as PDF
© 2022 JustPaste.it
Account
Terms
Privacy
Cookies
Blog
About Write, Run & Share Python code online using OneCompiler's Python online compiler for free. It's one of the robust, feature-rich online compilers for python language, supporting both the versions which are Python 3 and Python 2.7. Getting started with the OneCompiler's Python editor is easy and fast. The editor shows sample boilerplate code when you choose language as Python or Python2 and start coding.
OneCompiler's python online editor supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample python program which takes name as input and print your name with hello.
import sys
name = sys.stdin.readline()
print("Hello "+ name)
Python is a very popular general-purpose programming language which was created by Guido van Rossum, and released in 1991. It is very popular for web development and you can build almost anything like mobile apps, web apps, tools, data analytics, machine learning etc. It is designed to be simple and easy like english language. It's is highly productive and efficient making it a very popular language.
When ever you want to perform a set of operations based on a condition IF-ELSE is used.
if conditional-expression
#code
elif conditional-expression
#code
else:
#code
Indentation is very important in Python, make sure the indentation is followed correctly
For loop is used to iterate over arrays(list, tuple, set, dictionary) or strings.
mylist=("Iphone","Pixel","Samsung")
for i in mylist:
print(i)
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while condition
#code
There are four types of collections in Python.
List is a collection which is ordered and can be changed. Lists are specified in square brackets.
mylist=["iPhone","Pixel","Samsung"]
print(mylist)
Tuple is a collection which is ordered and can not be changed. Tuples are specified in round brackets.
myTuple=("iPhone","Pixel","Samsung")
print(myTuple)
Below throws an error if you assign another value to tuple again.
myTuple=("iPhone","Pixel","Samsung")
print(myTuple)
myTuple[1]="onePlus"
print(myTuple)
Set is a collection which is unordered and unindexed. Sets are specified in curly brackets.
myset = {"iPhone","Pixel","Samsung"}
print(myset)
Dictionary is a collection of key value pairs which is unordered, can be changed, and indexed. They are written in curly brackets with key - value pairs.
mydict = {
"brand" :"iPhone",
"model": "iPhone 11"
}
print(mydict)
Following are the libraries supported by OneCompiler's Python compiler
| Name | Description |
|---|---|
| NumPy | NumPy python library helps users to work on arrays with ease |
| SciPy | SciPy is a scientific computation library which depends on NumPy for convenient and fast N-dimensional array manipulation |
| SKLearn/Scikit-learn | Scikit-learn or Scikit-learn is the most useful library for machine learning in Python |
| Pandas | Pandas is the most efficient Python library for data manipulation and analysis |
| DOcplex | DOcplex is IBM Decision Optimization CPLEX Modeling for Python, is a library composed of Mathematical Programming Modeling and Constraint Programming Modeling |