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!
Program is to take two arguments and returns the string:
Program is to take two arguments and returns the string which is larger the larger string has larger ascii value invoke function from main
int compare(char *st,char *st2);
void main()
{
clrscr();
int x;
char st[20],st2[20];
int ans;
cout<<" enter the first string ";
gets(st);
cout<<" enter the second string ";
gets(st2);
ans=compare(st,st2);
if (ans==0)
cout<<" the larger string is "< else cout<<" the larger string is "< } int compare(char *st,char *st2) { int i=0; while(st[i]!='\0' && st2[i] != '\0') { if (st[i]==st2[i]) { i++; } else if (st[i]>st2[i]) return 1; else return 0; } return 0; }
else
cout<<" the larger string is "< } int compare(char *st,char *st2) { int i=0; while(st[i]!='\0' && st2[i] != '\0') { if (st[i]==st2[i]) { i++; } else if (st[i]>st2[i]) return 1; else return 0; } return 0; }
}
int compare(char *st,char *st2)
int i=0;
while(st[i]!='\0' && st2[i] != '\0')
if (st[i]==st2[i])
i++;
else if (st[i]>st2[i])
return 1;
return 0;
Project Description: collect / modify person records / photo images/ lookup / facebook iphone and ipad App basic function : 1 user will configure facebook connection
Explain about the strategies of implementation of the statecharts, Database Management System?
Develop a program to meet the following requirements: 1. Must use at least one function in addition to main (you can use more) 2. Must use selection 3. Must use deference/indire
A: By keeping along with the C++ tradition of "there's more than one method to do that" (translation: "give programmers options & tradeoffs so they can choose what's best for them
Greatest Common Divisor (GCD) - The greatest common divisor (GCD) of two integers is the largest integer that will evenly divide both integers. The GCD algorithm involves intege
Assume we wish to partition the square roots of the integers from 1 to 100 in to two piles of fifty numbers every, such that the sum of the numbers in the first pile is as close as
Public, Private and Protected members: Class members can either be declared in public','protected' or in the 'private' sections of the class. But as one of the features of OOP i
find the area of a curve y=f(x) between x=a and x=b integrate f(x) between limits a and b #include float start_point, /* GLOBAL VARIABLES */
#exercise
Op e r a t o r P r e c e d e n c e a n d A s s o c i a t i v e l y : T h e op e r a t o r p r e c e d e n c e a n d i
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