0
Add your answer:
Earn +20 pts
Wap to merge two arrays using c?
#include<stdio.h> void main() { int a[5],b[5]; int c[10]; int i,j,temp,k; printf("\n enter the elements of array A:=\n"); for(i=0;i<5;i++) scanf("%d",&a[i]); printf("\n enter the elements of array B:=\n"); for(i=0;i<5;i++) scanf("%d",&b[i]); for(i=1;i<5;i++) { for(j=0;j<5-i;j++) { if(a[j]>a[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } for(j=0;j<5-i;j++) { if(b[j]>b[j+1]) { temp=b[j]; b[j]=b[j+1]; b[j+1]=temp; } } } printf("\n the elements of the array A:=\n"); for(i=0;i<5;i++) printf("%d\t",a[i]); printf("\n the elements of the array B:=\n"); for(i=0;i<5;i++) printf("%d\t",b[i]); i=0,j=0,k=0; while(i<5&&j<5) { if(a[i]>b[j]) c[k++]=b[j++]; if(a[i]<b[j]) c[k++]=a[i++]; } if(i<5&&j==5) while(i<5) c[k++]=a[i++]; if(i==5&&j<5) while(j<5) c[k++]=b[j++]; printf("\n the elements of the sorted merged array C:=\n"); for(i=0;i<10;i++) printf("%d\t",c[i]); }
Is the Fibonacci sequence geometric?
No, but it can be expressed as the sum of two geometric sequences. F_n = a^n + b^n a = (1+sqrt{5})/2 b = (1-sqrt{5})/2
What has the author N B Tucker written?
N. B. Tucker has written: 'Data on temperature stabilization and diffuser performance of the 5 x 5 in. pilot blowdown wind tunnel'
If a is congruent to b mod m and a is also congruent to b mod n what is the relationship between m and n?
There need not be any. Consider (a, b, m, n) = (37, 2, 35, 7) where n is a factor of m.or (a, b, m, n) = (37, 2, 5, 7) where m and n are relatively prime.
What 5 letter word start with B and includes an n?
baconbandsbanjobanksbarnsbatonbenchbasinbeansbindsbingoblandblankblendblindblinkblownbluntbonesbongoboundbrainbrandbrawnbrinebrinkbrownbruntbuntsburnt
What are the 5 major highways in Nebraska?
n e b r a
Write a program to swap any number?
Do write, but before you start, please explain what does swapping a number mean.
Write a c program that interchanges the odd and even elements of an array?
#include<stdio.h> int main() { int num[]={1,2,3,4,5,6}; int i,temp; for(i=0;i<=5;i=i+2) { temp=num[i]; num[i]=num[i+1]; num[i+1]=temp; } for(i=0;i<=5;i=i+2) printf(''%d",num[i]); return 0; }
What is 2n if n equals 5?
n = 5Multiply each side of the equation b y 2:2n = 10
Can you please solve n divided by 5 equals n plus 1divided by 3?
n/5 = (n+1)/3 multiply both sides by 5 n = (5n + 5)/3 multiply both sides by 3 3n = 5n + 5 subtract 3n from both sides 0 = 2n + 5 subtract 5 from both sides -5 = 2n divide both sides by 2 n = -2.5
C program to print all combinations of a 4-digit number?
#include<stdio.h> int main() { int a,b,c,d; for(a=1; a<5; a++) { for(b=1; b<5; b++) { for(c=1; c<5; c++) { for(d=1; d<5; d++) { if(!(a==b a==c a==d b==c b==d c==d)) printf("dd\n",a,b,c,d); } } } } return 0; }
How do you expand binomials A plus b to the degree of n?
It isnC0*A^n*b^0 + nC1*A^(n-1)*b^1 + ... + nCr*A^(n-r)*b^r + ... + nCn*A^0*b^n where nCr = n!/[r!*(n-r)!]
