![]() |
|
|
|||||||
![]() |
![]() |
![]() |
![]() |
Mark Forums Read |
| Programming :: Programming related discussions :: |
![]() |
|
|
LinkBack | Thread Tools |
|
#1
|
|
![]() Code:
void f(int, int);
main()
{
Â* int x = 5;
Â* printf("x : %d \t\t %d\n", x++, ++x);
Â* f(x, x++);
}
void f(int x, int y)
{
Â* printf("f : x = %d \t y = %d\n", x, y);
}
|
||||||
|
#2
|
|
postincrement and preincrement exercise.
void f(int, int); main() { int x = 5; printf("x : %d \t\t %d\n", x++, ++x); // ang outpuit ani is x: 6 6 // x is now 7, because it's postincremented by 1 f(x, x++); // C evaluates the left param first, then postincremented } void f(int x, int y) { printf("f : x = %d \t y = %d\n", x, y); // y = 7, since it's postincrementedm x:8 } |
||||
|
#3
|
|
#12
|
|
void ehem (void) __attribute__ ((constructor)); // empty main method ![]() main() { } void ehem (void) { printf ("gloryhound"); } |
|||||
|
#13
|
|
ang solusyon ani nga puzzle nag depende kung gi unsa pag implement ang stack. depende sa operating system.. ang uban machines... gi process ang stack from left to right.. nya ang uban from right to left.... that's why duha ang solusyon sa puzzle.... |
|||||||