Algorithm
START
Step 1: Read how many lines/(numbers) to 'n'
Step 2: Allocate the required memory and refer to pointer 'p'
Step 3: Let i = 0 and s = 0
Step 4: Repeat Step 4 to Step 8 for i < n
Step 5: Read a line/string which presumably a string of digits
Step 6: Convert the string into integer and store it to *(p+i)
Step 7: s = s + *(p+i)
Step 8: i = i + 1
Step 9: Calculate the Average or Mean of the integers and store to
'avg' i.e., avg = s/n
/****** Calculation of Standard Deviation ******/
Step 10: Let i = 0 and x = 0.0
Step 11: Repeat Step 11 to Step 14 for i < n
Step 12: Compute the deviation by subtracting 'avg' from *(p+i)
Step 13: Square the deviation and Add up the squared deviations to
'x'
Step 14: i = i + 1
Step 15: Divide 'x' by 'n' and take the square root of it and store
it to 'sd'
/****** Print all the numbers read ******/
Step 16: Let i = 0
Step 17: Repeat Step 17 to Step 19 for i < n
Step 18: Print *(p+i)
Step 19: i = i + 1
Step 20: Print Average :- 'agv' and Standard Deviation :- 'sd'
STOP