import jeliot.io.*;
public class hitung {
public void input(){
System.out.println("tentukan nilai n:");
n=Input.readInt();
}
public void proses(){
jumlah=0;
total=0;
rumus=-1;
for(int j=1; j<=n; j++)
{
rumus=(rumus*(-1));
total=rumus/j;
jumlah+=total;
if(j==1)
System.out.println(+total);
if(j>1)
System.out.println(+total);
System.out.println("hasil penjumlahan deret = "+jumlah);
}
}
private int n;
private float rumus,jumlah,total;
public static void main() {
hitung h=new hitung();
h.input();
h.proses();
}
}
Artikel Terkait:
Java
Jeliot 3
Algoritma dan Pemrograman
- Class Inheritance
- OOP Recursive Decent Parsing III
- OOP Recursive Decent Parsing II
- OOP Recursive Decent Parsing I
- A Comparison of Sorting Algorithms
- Typical data sequences for testing sorting algorithms
- Quicksort Algorithm
- Vector
- Function to reverse an integer array
- Array
- String Contains function
- RECCURENCE RELATION
- Recursion
- Recursion Shortest Function to Reverse a String
- Calculator (C++)
- Recursive Format numbers with commas
- Calling functions with Inline Assembly
- Recursive Function
- Algoritma Menentukan Tahun Kabisat
- Algoritma dan Class Bilangan Prima
- Class Luas Lingkaran dan Volume Bola With Jeliot
- Class Bilangan [Bahasa C++]
- Struktur Perulangan (Lanjutan)
- Struktur Perulangan
Comments :
0 comments to “Calculate Sequebce by Using Iterative Function”
Post a Comment