RECCURENCE RELATION

use the iteration scheme for a SERIES of ISSUES the formula can be expressed in relationship/recurring relationship, which concerns the issue of accuracy of the representation of numbers on a computer.

Example :

Lineup : 1,2,3,4,5,...,n

 Algorithm lineup

  Deklarasi

    i,n : integer

  Deskripsi

    input(n)

    i<1

    s<0

    while (i<=n) do

      output(i)

      ißi+1

    endwhile

The series S = 1 + 2 + 3 + 4 + 5 + ... + n

The Algorithm To Calculate The series

The Declaration Of i, S, n: integer Description input (n) i< 1 S < 0 while (i < = n) do outputs (i) S S + 1 i i + 1 endwhile output (S)

Artikel Terkait:

Algoritma dan Pemrograman

• Class Inheritance
• OOP Recursive Decent Parsing III
• OOP Recursive Decent Parsing II
• OOP Recursive Decent Parsing I
• Calculate Sequebce by Using Iterative Function
• 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
• 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