Answer:
Explanation:
A cursor is a pointer which indicates the position of the mouse on a computer's display monitor.
An insertion point is a location in a document where additional information is inserted when the user begins to type.
A mouse pointer is an image used to activate/control certain elements in a GUI (graphical user interface).
I know you asked for the differences, though i thought I'd add a similarity. All of these 3 things are similar, as they show where the position of the info/mouse is. :)
Hope this helps!
-Biscuit08
Answer: Parameters
Explanation:
Whenever a call to a recursive function is made, then the function has its own code and its own set of parameters with local variables. These parameters are within the scope of the recursive function. For example while finding the factorial of a number we are given the function with parameter such as int recursive(int n) where int n is a parameter passed into the function.
Answer:
# include <iostream.h>
# include <stdio.h>
# include <string.h>
using namespace std;
class citizen
{
int i;
public string name[30];
public long int phonenumber[30];
public void addindividual(string name1)
{
If (i<=30)
{ int flag=0;
for(int j=0; j<=i;j++)
{
if (strcmp(name[i], name1)
{
flag=1;
}
else
{
flag=0;
}
}
If (flag)
{
if (i<30)
{
for(j=i+1;j<=30; j++)
{
cout<<"Enter the name:"; getchar(name[j]);
cout<<"Enter the phone number:"; cin>>phonenumber[j];
i++;
}
else
{
cout<<"The person already exists";
exit();
}
}
else
{
cout<<"array is full:";
exit();
}
}
}
Void main()
{
string str;
cout<<" Enter name:";
getline(cin, str); ;
citizen c1=new citizen();
c1.addindividual(name1);
}
Explanation:
With a little more effort you can make the program allow the user to enter any number of details, but less than 30 overall. We have used here flag, and as a programmer we know why we use the Flag. It is used to check whether certain Boolean condition is fulfilled or not. Here, we are checking whether a given name is present in the array of names, and if it is not present, we add that to the list. And if the name is present, we print, it already exist.
