Pertemuan Hari ke - 1 Sesi-3.

Slides:



Advertisements
Similar presentations
Soal-3 Susun program untuk menginput tiga (3) buah bilangan bulat (misal A, B dan C dimana ABCA), kemudian mencetak ketiga nilai tersebut urut dari.
Advertisements

For(int i = 1; i
void count_down (int count) { for(i=count; i>1; i--) printf(" %d\t", count); } printf("A%d\n", count); if(count>1) count_down(count-1); printf("B%d\n",
Fuel cell development program for electric vehicle
Mitchell Cox University of the Witwatersrand, Johannesburg
Solar Astronomy with LOFAR - First Steps
Gil Kalai Einstein Institute of Mathematics
Summary.
GDOT Approach to Wall Foundation Investigations
Constraint-Aware Software-Defined Network for Routing
Year 12 physics summary Use this as a reminder of content and a way of identifying weakness, NOT as a replacement for revision.
Three Eras of Cosmology
Knowledge Sharing: GSP Pump Energy Assessment
MEC-E5005 Fluid Power Dynamics L (5 cr)
Cavity locking, thermal effects and the phase cameras
Non-Hermitian supersymmetric structures
Precision mass measurements of
The LHCb Calorimeter System: Design, Performance and Upgrade
Jobs and Unemployment Goals for this chapter
Macroeconomics: Economic Growth Master HDFS
Cosmic-ray iron and electron detection with H.E.S.S.
Performance – meaning and metrics
Ratios and Scale UMI: July 20, 2016.
The Structure of Atoms.
LECTURE 8 The Definite Integral.
Availability Operating systems I800
PREDICT 422: Practical Machine Learning
西村美紀(東大) 他 MEGIIコラボレーション 日本物理学会 2016年秋季大会 宮崎大学(木花キャンパス)
Deep Automatic Portrait Matting
Chi Square Test X2.
Materials for Energy Storage
Chapter 1 Managers, Profits, and Markets
Section 5.1 Review and Preview.
Computational Physics (Lecture 3)
Systematic Managed Floating Jeffrey Frankel Harpel Professor of Capital Formation and Growth Harvard Kennedy School, Harvard University 4th Asian Monetary.
Diverse Beam Search Ashwin Kalyan
WPI Mathematics Institute for Secondary Teaching (MIST) 2017
James P. Fowler and Thomas J. Galarneau, Jr.
Feng Duan, Yu Lei, Linbin Yu, Raghu N. Kacker, D. Richard Kuhn
MedDRA Coding for Adverse Event (AE) Logs
Christmas.
Prepared by Debby Bloom-Hill CMA, CFM
Rank Size Rule And Primate Cities
Supply Chain Drivers and Obstacles
Klein Swim & Dive Meet the Bearkats Parent Info Meeting
MRI OF FACIAL COSMETIC INJECTABLE FILLERS: AN ANALYTIC APPROACH for IDENTIFICATION OF INJECTED SUBSTANCE, COMPLICATIONS AND SYMMETRY OF INJECTED SITES.
Introduction to Data Mining
Supervisor: Jay X. Wang, Ph.D., P.E.
Unit 3, Lesson 1 Growth and Development
Contents Tectonic explanation for the 2011Japan tsunami
Laser particle acceleration Norman Rostoker Chair Professor, UC Irvine
Michael DiDiego Draft Personal Research Opinion Paper
The Final Passage - Grief and Loss
Introduction: The enduring context of IHRM
How many candies are there in my box?
Empirical investigation of the divestment options embedded in takeover premia paid by U.S. public acquirers P. Alexakis, National & Kapodistrian University.
Properties Of Water And Sea Water
Economic Growth in Developing Nations
Muscle structure and contraction
Years of Crisis, 1919–1939 Societies undergo political, economic, and social changes that lead to renewed aggression.
EE5900: Cyber-Physical Systems Hardware and IoT Security
Highlights from Toyota Talent: Developing People the Toyota Way
PT. SURYA ENERGY SOLUTION
Traditional Literature
Preparing for Birth Chapter 5.
Viral and Immune System Dynamics of HIV-1, CD4+ T Cells and Macrophages during the Acute, Clinically Latent and Late Phases of HIV Infection Nargesalsadat.
The nested repetition control structures & Continue Statements
I ;J\;J\ _\_\ -
Character Arrays char string1[] = “first”;
Iteration Statement for
Presentation transcript:

Pertemuan Hari ke - 1 Sesi-3

A #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; } 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11

A Misal : i & j j #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; } j 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 i Misal : i & j

A j i j #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( i=0; i<=2; i++ ) { for ( j=0; j<=4; j++ ) { } j i j 0 1 2 3 4 1 2 5 12 17 10 7 1 2 3 4 15 6 25 2 19 4 9 20 22 11 1 1 2 3 4 i 2 1 2 3 4

A urutan proses j i j #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( i=0; i<=2; i++ ) { for ( j=0; j<=4; j++ ) { . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . } j i j 0 1 2 3 4 1 2 5 12 17 10 7 1 2 3 4 15 6 25 2 19 4 9 20 22 11 1 1 2 3 4 i urutan proses 2 1 2 3 4

? A j i j } apa yang trcetak #include <stdio.h> void main( ) 0 1 2 3 4 #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( i=0; i<=2; i++ ) { for ( j=0; j<=4; j++ ) { if ( A [ i ][ j ] < 12 ) { printf ("%i ", A [ i ][ j ] ); } i j 1 2 5 5 12 12 17 17 10 10 7 7 1 2 3 4 15 15 6 6 25 25 2 2 19 19 4 4 9 9 20 20 22 22 11 11 1 1 2 3 4 i 5 10 7 6 2 4 9 11 2 1 2 3 4 ? apa yang trcetak ?

j #include <stdio.h> void main( ) 0 1 2 3 4 #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; } 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 i

j #include <stdio.h> void main( ) 0 1 2 3 4 #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { } 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 i

j i j #include <stdio.h> void main( ) 0 1 2 3 4 #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { } j i 1 2 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 1 1 2 i 2 1 2 3 1 2 4 1 2

j i j #include <stdio.h> void main( ) 0 1 2 3 4 #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { } j i 1 2 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 1 1 2 i 2 1 2 3 1 2 4 1 2

? j i } apa yang trcetak #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { if ( A [ i ][ j ] < 12 ) { printf ("%i ", A [ i ][ j ] ); } j i 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 1 1 2 2 1 2 3 1 2 4 1 2 ? apa yang trcetak

? j i } Tercetak : 5 4 6 9 10 2 7 11 apa yang trcetak #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { if ( A [ i ][ j ] < 12 ) { printf ("%i ", A [ i ][ j ] ); } j i 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 1 1 2 Tercetak : 2 1 2 5 4 6 9 10 2 7 11 3 1 2 4 1 2 ? apa yang trcetak

? j i } Tercetak : 5 4 6 9 10 2 7 11 apa yang trcetak #include <stdio.h> void main( ) { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j ; for ( j=0; j<=4; j++ ) { for ( i=0; i<=2; i++ ) { if ( A [ i ][ j ] < 12 ) { printf ("%i ", A [ i ][ j ] ); } j i 5 5 12 12 17 17 10 10 7 7 1 2 15 15 6 6 25 25 2 2 19 19 4 4 9 9 20 20 22 22 11 11 1 1 2 Tercetak : 2 1 2 5 4 6 9 10 2 7 11 3 1 2 4 1 2 ? apa yang trcetak

Menghitung Total

i A j T #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; } A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i T

? i A j T Apa yang tercetak #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 i T ? Apa yang tercetak 17

i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j 0 0 1 2 3 4 5 1 0 2 0 dan seterusnya j 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 i 18

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 19

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 20

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 21

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 3 44 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 22

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 3 44 4 51 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 23

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 3 44 4 51 5 1 0 66 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 24

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 3 44 4 51 5 1 0 66 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 T < 60 bernilai FALSE  keluar dari Loop 25

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A i j T 0 0 5 1 17 2 34 3 44 4 51 5 1 0 66 0 1 2 3 4 5 12 17 10 7 1 2 1 2 15 6 25 2 19 4 9 20 22 11 Tercetak : 66 26

atau 27

i A j T #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A j 0 1 2 3 4 5 5 12 12 17 17 10 10 7 7 1 2 1 2 15 15 6 25 2 19 4 9 20 22 11 i 66 51 17 34 44 5 T Tercetak : 66 28

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[ i ] [ j ] ; j=j+1; if( j==5) { j=0; i++; } printf(“%i “, T ); A 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 Tercetak : 66

cara lain 31

? i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, n=0, j=0, T=0; while( T < 60 ) { i=n/5; j=n%5; n++; T = T + A[ i ] [ j ] ; } printf(“%i “, T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i ? Apa yang tercetak 32

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, n=0, j=0, T=0; while( T < 60 ) { i= n/5; j=n%5; n++; T = T + A[ i ] [ j ] ; } printf(“%i “, T ); A 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 33

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, n=0, j=0, T=0; while( T < 60 ) { i= n/5; j=n%5; n++; T = T + A[ i ] [ j ] ; } printf(“%i “, T ); A i = j = n n/5 n%5 0 0 0 1 0 1 2 0 2 3 0 3 4 0 4 5 1 0 6 1 1 7 1 2 dan seterusnya 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 34

A #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, n=0, j=0, T=0; while( T < 60 ) { i= n/5; j=n%5; n++; T = T + A[ i ] [ j ] ; } printf(“%i “, T ); A i = j = n n/5 n%5 0 0 0 1 0 1 2 0 2 3 0 3 4 0 4 5 1 0 6 1 1 7 1 2 dan seterusnya 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 35

? i A j Apa yang tercetak #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[i][j] ; i=i+1; if( i==3) { i=0; j++; } printf(" %i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i ? Apa yang tercetak

A int i=0, j=0, i=i+1; if( i==3) { i=0; j++; } i j 0 0 1 0 2 0 3 0 1 0 0 1 0 2 0 3 0 1 1 1 2 1 0 2 1 2 2 2 0 3 1 3 dan seterusnya A 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 38

? A int i=0, j=0, T=0; while( T < 60 ) { T = T + A[i][j] ; i=i+1; if( i==3) { i=0; j++; } printf(" %i ", T ); i j 0 0 1 0 2 0 3 0 1 1 1 2 1 0 2 1 2 2 2 0 3 1 3 dan seterusnya A 0 1 2 3 4 1 2 5 12 17 10 7 15 6 25 2 19 4 9 20 22 11 ? Apa yang tercetak 39

i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i=0, j=0, T=0; while( T < 60 ) { T = T + A[i][j] ; i=i+1; if( i==3) { i=0; j++; } printf(" %i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i Tercetak : 68

? i A j Apa yang tercetak #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, n=0, T=0; while( T < 60 ) { i=n%3; j=n/3; n++; T = T + A[i][j] ; } printf(" %i ", T ); j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i ? Apa yang tercetak

i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, n=0, T=0; while( T < 60 ) { i=n%3; j=n/3; n++; T = T + A[i][j] ; } printf(" %i ", T ); j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i Tercetak : 68

? i A j Apa yang tercetak #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, T=0; for( i=0; i<=2; i++ ) { for( j=0; j<=4; j++ ) { T = T + A[ i ][ j ] ; if( T > 60 ) { break; } } printf("%i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i ? Apa yang tercetak

i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, T=0; for( i=0; i<=2; i++ ) { for( j=0; j<=4; j++ ) { T = T + A[ i ][ j ] ; if( T > 60 ) { break; } } printf("%i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i Tercetak : 70

? i A j Apa yang tercetak #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, T=0; for( i=0; i<=2; i++ ) { for( j=0; j<=4; j++ ) { T = T + A[ i ][ j ] ; if( T > 60 ) { i=2; j=4; } } printf("%i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i ? Apa yang tercetak

i A j #include <stdio.h> void main() { int A[3][5] = { 5, 12, 17, 10, 7, 15, 6, 25, 2, 19, 4, 9, 20, 22, 11 }; int i, j, T=0; for( i=0; i<=2; i++ ) { for( j=0; j<=4; j++ ) { T = T + A[ i ][ j ] ; if( T > 60 ) { i=2; j=4; } } printf("%i ", T ); A j 0 1 2 3 4 5 12 17 10 7 1 2 15 6 25 2 19 4 9 20 22 11 i Tercetak : 66

Mengisi array dua dimensi

? i A j Apa isi array #include <stdio.h> i j void main() { int A[3][5]; int i, j, N=1; for( i=0; i<=2; i++ ) { for( j=0; j<=4; j++ ) { A[ i ][ j ] = N; N=N+1; } i j j 0 1 2 3 4 1 2 3 4 1 2 1 1 2 3 4 i 2 1 2 3 4 ? Apa isi array

? i A j j i Apa isi array #include <stdio.h> void main() { int A[3][5]; int i, j, N=1; for( j=0; j<=4; j++ ) { for( i=0; i<=2; i++ ) { A[ i ][ j ] = N; N=N+1; } j i j 0 1 2 3 4 1 2 1 4 7 10 13 1 2 2 5 8 11 14 1 1 2 3 6 9 12 15 2 1 2 3 1 2 i ? Apa isi array 4 1 2