Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    p4.2 Tutor Perulangan

    Uploaded by

    Gede Ananda
    The document discusses several methods for calculating the sum of the first N odd numbers: - It defines an odd number as 2k+1 and illustrates the first few odd numbers - It provides two algorithms using a for loop or while loop to calculate the sum by iterating from 1 to N and adding 2k+1 to the running total at each step - It also demonstrates how to access elements in 1D and 2D arrays using indices and loops to print out array elements

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    p4.2 Tutor Perulangan

    Uploaded by

    Gede Ananda
    13 views10 pages
    The document discusses several methods for calculating the sum of the first N odd numbers: - It defines an odd number as 2k+1 and illustrates the first few odd numbers - It provides two algorithms using a for loop or while loop to calculate the sum by iterating from 1 to N and adding 2k+1 to the running total at each step - It also demonstrates how to access elements in 1D and 2D arrays using indices and loops to print out array elements

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses several methods for calculating the sum of the first N odd numbers: - It defines an odd number as 2k+1 and illustrates the first few odd numbers - It provides two algorithms using a for loop or while loop to calculate the sum by iterating from 1 to N and adding 2k+1 to the running total at each step - It also demonstrates how to access elements in 1D and 2D arrays using indices and loops to print out array elements

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    13 views10 pages

    p4.2 Tutor Perulangan

    Uploaded by

    Gede Ananda
    The document discusses several methods for calculating the sum of the first N odd numbers: - It defines an odd number as 2k+1 and illustrates the first few odd numbers - It provides two algorithms using a for loop or while loop to calculate the sum by iterating from 1 to N and adding 2k+1 to the running total at each step - It also demonstrates how to access elements in 1D and 2D arrays using indices and loops to print out array elements

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 10

    Menghitung Jumlah N bilangan ganjil pertama

    • Bilangan ganjil: 1, 3, 5, 7, 9, ........


    • Bg0 = 1
    • Bg1 = 3
    • Bg2 = 5
    • Bg3 = 7
    • Bg4 = 9

    • Bilangan ganjil k = k*2 + 1

    • Jumlah = 0
    • for (idx=0 ; idx < N; idx++)
    • jumlah = jumlah + (idx*2) + 1
    •N
    •K=0
    • Jumlah = 0
    • While k<N do
    • jumlah = jumlah + ((k*2) +1)
    • End while
    Menghitung Jumlah N bilangan ganjil pertama
    • Bilangan ganjil: 1, 3, 5, 7, 9, ........
    • Bg1 = 1
    • Bg2 = 3
    • Bg3 = 5
    • Bg4 = 7
    • Bg5 = 9

    • Bilangan ganjil k => (k-1)*2 + 1


    • k =1 => (1-1)*2 + 1 = 0 * 2 + 1 = 1
    • K = 2 => (2-1)*2 + 1 = 1*2 + 1 = 3
    • Jumlah = 0
    • for (idx=1 ; idx <= N; idx++)
    • jumlah = jumlah + ((idx-1)*2) + 1
    Array 1D
    • A : array [0 ....4]
    •A 0 1 2 3 4

    • Panjang array A = 5
    • A[0] = 4
    0 1 2 3 4
    4

    • A[3] = 10 0 1 2 3 4
    4 10
    Array 1D
    • A : array [0 ....4]
    •A 0 1 2 3 4

    • Panjang array A = 5

    • for (idx=0 ; idx < 5 ; idx++)


    • print A[idx}
    Array 1D
    • A

    • for (idx=0 ; idx < 5 ; idx++)


    • print A[idx} 0 1 2 3 4
    10 20 30 40 50
    • Idx = 0
    • Print A[0] => 10
    • Idx = 1
    • Print A[1] => 20
    • Idx = 2
    • Print A[2] => 30
    • Idx = 3
    • Pritn A[3] = > 40
    • Idx = 4
    • Print A[4] => 50
    Array 2D
    0 1 2

    •A 0 10 20 30
    1 40 50 60

    • A[0,0] = 10
    • A[0,1] = 20

    • For (baris = 0 ; baris <=1 ; baris++)


    • for (kolom=0 ; kolom <= 2 ; kolom++)
    • cetak A[baris , kolom]
    Array 2D
    0 1 2
    • A 0 10 20 30
    1 40 50 60
    • Baris = 0
    • Kolom = 0
    • Cetak A[0,0] => 10
    • Kolom = 1
    • Cetak A[0,1] => 20
    • Kolom = 2
    • Cetak A[0,2] => 30
    • Baris = 1
    • Kolom = 0
    • Cetak A[1,0] =>40
    • Kolom = 1
    • Cetak A[1,1] => 50
    • Kolom = 2
    • Cetak A[1,2] => 60
    Problem
    N= 4 N=5
    * *
    ** **
    *** ***
    **** ****
    N= 2 *****
    *
    **
    Problem
    N=3 N=3
    ***
    ** *****
    * ***
    N=4 *
    **** ***
    *** *****
    **
    *

    You might also like