is there any way to calculate the sum of n terms of harmonic progression?

Answer 1

Yes it has been done by making use of fibonacci's series.

Answer 2

standard harmonic progression sum:

In C++:

void main() {
int n=0, sum=0;
cout << "Enter terms\n";
cin >> n;
for (int i=1; i cout << "Sum is " << sum << "\n";
}

in English:
1+1/2+1/3+1/4+1/5+1/6+1/7+...

Other harmonic progressions can be like, 1+1/3+1/5+1/7 or 1+1/50+1/100+1/150 or whatever steps you want.

If you're looking for like a shortcut, there's none that I can think of off the top of my head.