Algoritma deklarasi A[maks][maks],baris,kolom::integer deskripsi read (baris,kolom) for i <-- 1 to n -1 do for j <-- 1 to n-1 do baris,kolom := A[i][j] for i <-- 1 to n-1 do for j <-- 1 to n-1 do for z <-- 1 to n-1 do hasil := A[i][j]*2[m] endfor endfor endfor C++ #include <iostream> #define maks 10 using namespace std; /* run this program using the console pauser or add your own getch, system("pause") or input loop */ int main(int argc, char** argv) { int A[maks][maks], baris, kolom; cout<<"input baris :"; cin>>baris; cout<<"input kolom :"; cin>>kolom; for(int i=0; i<baris; i++){ for(int j=0; j<kolom; j++){ cout<<"Masukan data ke ["<<i<<"] ["<<j<<"] : "; cin>>A[i][j]; } } cout<<"Isi Matriks A :\n"; for(int i=0; i<baris; i++){ for(int j=0; j<kolom; j++){ cout<<A[i][j]<<" "; } cout<<endl;
Algoritma : Procedure selection_sort(output A : larik; input n : integer) Deklarasi i, t : integer Deskripsi for i <-- 1 to n do minimum(A, i, n, t); tukar(A[i], A[t]); {tukar tempat elemen saat ini j dengan elemen terkecil yang ditemukan t} endfor Flowchart : #include <iostream> #include <cstdlib> using namespace std; void baca_data(int A[], int n){ int i; for (i = 0; i < n; i++){ cout << "Data ke-%d : ",i+1); cin >> A[i]); } } void cetak_data(const int A[], int n){ int i; for (i = 0; i < n; i++) cout << "%d ",A[i]); cout << "\n"); } void tukar (int *a, int *b){ int temp; temp = *a; *a = *b; *b = temp; } void minimum(int A[], int dari, int n, int * tempat){ int i, min; min = A[dari]; *tempat = dari; for (i = dari+1; i<n; i++) if (A[i] < min){ min = A[i];