I do not even know wht to tell u
Answer:
The algorithm:
Input days
sum = 0
for i = 1 to 
input text
sum = sum + text
end for
average = sum/days
print average
The program in pascal:
var days, sum, text, i:integer;
var average : real;
Begin
write ('Days: '); readln(days);
sum:=0;
for i := 1 to
do 
write ('Text: '); readln(text);
sum:=sum+text;
end;
average := (sum/days);
writeln ('The average text is' , average);
End.
Explanation:
This declares all variables
var days, sum, text, i:integer;
var average : real;
This begins the program
Begin
This gets the number of days from the user
write ('Days: '); readln(days);
Initialize sum to 0
sum:=0;
This iterates through the days
for i := 1 to
do begin
This gets the text for each day
write ('Text: '); readln(text);
This sums up the texts
sum:=sum+text;
End loop
end;
Calculate average
average := (sum/days);
Print average
writeln ('The average text is' , average);
End program
End.
Answer:
People prefer composite faces.
Explanation:
If we take some face's picture, and we make it digital, we could make a composite or averaged face, and when we compare composite faces with originals pictures, people prefer the composite faces because there was symmetry in those faces.
For example:
There was a research where a digitalized student faces men and women, researchers make a composite face for every original, people prefer composite face against the original face.
Answer:
int sumAll(int n)//function definition.
{
if(n==1)//if condition.
return 1;
else//else condition.
{
return n+sumAll(n-1);//return the value and call the function in recursive manner.
}
}
Explanation:
- The above-defined function is a recursive type function that is written in the c language, which holds the if and else condition.
- When the user passes the largest value from 1, then the else condition will be executed which adds the largest value and pass the value after the decrement of the value as an argument.
- When the value will become 1, then the function if-block will be executed which returns the value and ends the calling function recursively.