CREATE OWN LIBRARY
Series 7
Back to ProgrammingDescription
The program is written here to find the value of the series (1^1) + (2^2) + (3^3) + (4^4) + (5^5) + ... + (n^n). Here, the value of ‘n’ is taken as input from the user. The ‘for’ loop is used here to calculate the value of the series.
For example, if the input is 3 then the value of the series will be:
1^1 + 2^2 + 3^3 = 1+4+27 = 32
Algorithm
INPUT: Number of terms
OUTPUT: The value of the series after calculation
PROCESS:
Step 1: [Taking the input]
Read n [Number of terms]
Step 2: [The value of the series]
Set s<-0
[Finding the sum of the series]
For i=1 to n repeat
Set s<-s+ ii
[End of ‘for’ loop]
[Printing the sum of the series]
Print "The sum of the series is: s"
Step 3: Stop.
Code
TIME COMPLEXITY:
for(i=1;i<=n;i++)--------------------------O(n)
s=s+pow(i,i);
The time complexity of this program is O(n) where ‘n’ is the number of terms of the series.
SPACE COMPLEXITY:
The space complexity of this program is O(1) as it requires a constant number of memory spaces for any given input.
