The series is tantamount to a row or sequence, for example 3,4,5,6, ...; 1,2,3,4,5, ... ... and there are many others.

Algoritmanya deretan :
Membaca n (banyak suku), kemudian menentukan deret dari banyak suku tersebut}


n : integer           {banyak suku}


Read n
for (int i=0; i<=n; i++)
write i

program C++
#include <iostream.h> #include <conio.h> class Deret { public : int proses(); private : int n; }; int Deret::proses() { cout << "Sampai berapa suku ? "; cin >> n; for (int i=0; i<=n; i++) { cout<<"1/"<< i<<" + "; } } int main() { Deret x; x.proses(); getch(); return 0; }
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: