Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /******************************************************************************
- Online C Compiler.
- Code, Compile, Run and Debug C program online.
- Write your code in this editor and press "Run" button to compile and execute it.
- *******************************************************************************/
- #include <stdio.h>
- #include <string.h>
- int swap(int *n1, int *n2);
- void BubbleSort(int a [] , int n);
- int MinRecursion(int a [] , int n);
- int intersect3(int a[], int n, int b[],int m,int c[],int r,int d[]);
- int maxfun(int a , int b ,int c);
- int main()
- {
- /*
- int a[100],n;
- printf("\n Please Enter the total Number of Elements : ");
- scanf("%d", &n);
- printf("\n Please Enter the Array Elements : ");
- for(int i = 0;i<n;i++)
- scanf("%d", &a[i]);
- //
- printf("the Min is : %d", MinRecursion(a,n));
- /*
- BubbleSort(a, n);
- for(int i = 0;i<n;i++)
- printf("%d",a[i]);
- return 0;
- */
- int a[6] = {1,2,6,9,11,35};
- int b[7] = {2,5,6,7,8,9,11};
- int c[6] = {2,6,8,9,11,66};
- int d[7] ;
- printf("value is : %d",intersect3(a,6,b,7,c,6,d));
- }
- int maxfun(int a , int b ,int c)
- {
- int max = a;
- int arr[3];
- arr[0]= a;
- arr[1] = b;
- arr[2] = c;
- for(int i=1;i<3;i++)
- {
- if(arr[i]>max)
- max = arr[i];
- }
- return max;
- }
- int intersect3(int a[], int n, int b[],int m,int c[],int r,int d[])
- {
- int i=0,j=0,z=0;
- int placeD=0;
- int max;
- while(i!=n && j!=m && z!=r)
- {
- if(a[i]==b[j] && a[i]==c[z])
- {
- d[placeD] = a[i];
- placeD++;
- ++i,++j,++z;
- }
- else
- {
- max = maxfun(a[i],b[j],c[z]);
- if(a[i]<max)
- i++;
- if(b[j]<max)
- j++;
- if(c[z]<max)
- z++;
- }
- }
- return (placeD);
- }
- int MinRecursion(int a [] , int n)
- {
- if(n==0)
- return a[0];
- if(*(a+n-1)<a[0])
- {
- int help = *(a+n-1);
- *(a+n-1) = a[0];
- a[0] = *(a+n-1);
- }
- MinRecursion(a,n-1);
- }
- int swap(int *n1, int *n2)
- {
- int p = *n1;
- *n1 = *n2;
- *n2 = p;
- }
- void BubbleSort(int a [] , int n)
- {
- for(int i=0;i<n-1;i++)
- {
- if(a[i]>a[i+1])
- {
- swap(&a[i],&a[i+1]);
- }
- }
- if(n)
- BubbleSort(a,n-1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement