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;
Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is
Hiding overloaded functions We cannot overload a base class function by redefining it in a derived class with a dissimilar argument list. Consider examples to see if similar fu
Description A long time ago in a galaxy far, far away, the country Mafghanistan had n cities and m old roads, where each road connected a pair of cities. Due to the treacherous mo
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
#question.develop an algorithm using pseudocode for computing cos(x) and sin(x). use a sentinel controlled while loop. use the series definition of e^+-jx
Record separation problem Let us assume that a particular database program manages a simple mailing list which consists of one record for each person on the list, and a number of f
padovan string
what is an array?
How do you know that your class requires a virtual destructor? A: If at least your class has one virtual function, you must make a destructor for this class virtual. It will let
Op e r a t o r O v e r l o a d i n g : W h e n a n o p e r a t o r i s u s e d f o r d i ff e r e n t op e r a
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