Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C Program for FUNCTION OF MERGE
#include conio.h>
#include stdio.h>
char cot(char a[],char b[]);
void main()
{
char a[50],b[50];
clrscr();
printf("ENTER THE FIRST STRING: ");
gets(a);
printf("ENTER THE SECOND STRING: ");
gets(b);
cot(a,b);
getch();
}
char cot(char a[],char b[])
char p[50]; int i,j;
for(i=0;a[i]!='\0';i++)
p[i]=a[i];
p[i]=' ';
for(j=0;b[j]!='\0';j++)
p[i+j+1]=b[j];
p[i+j+1]='\0';
printf("%s",p);
OUTPUT :
ENTER THE 1 STRING: KAMLESH
ENTER THE 2 STRING: MENGAR
KAMLESH MENGAR
Need someone to look over my assignment for correctness and make any necessary changes.
write a queue program in c langauge?
what is c language
can you tell me what is c#
what is programming?
Why copy constructor accepts reference to an object and not the object itself, whether ah hence it we do otherwise
Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books
The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole
flow chart for prime or not
Problem : Compiler Design - Limit the methods Rahul is a newbie to the programming and while learning the programming language he came to know the following rules: ·
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd