Tugas 3 algoritma Struktur Data
12345678910111213141516171819
#include <iostream>
using namespace std;
int main() {
int a,b;
/*Penggunaan Notasi Didepan Variabel*/
a=10; b=5;
printf("Nilai A \t\t= %d" ,a); printf("\nNilai ++A \t\t= %d",++a);
printf("\nNilai B \t\t= %d" ,b);printf("\nNilai --B\t\t =%d",b);
cout<<endl<<endl;
/*Penggunaan Notasi Dibelakang Variable*/
a=10; b=5;
printf("Nilai A \t\t= %d" ,a); printf("\nNilai A++ \t\t= %d", a++);
printf("\nNilai A \t\t= %d",a); printf("\nNilai B \t\t= %d",b);
return 0;
}
Cpp
INFO