tree is a list :P
* anyway, some changes here
-> a struct T consumes sizeof(struct T) of memory
-> actual wasn't really needed here. thrown away.
committer: Markus Bröker <mbroeker@largo.homelinux.org>
/**
* test/demos/endian.c
* Copyright (C) 2008 Markus Broeker
*/
#include <stdio.h>
#include <stdlib.h>
int endian ()
{
unsigned short word = 0x1234;
unsigned char *p = (unsigned char *)&word;
return ((p[0] == 0x34) ? 0 : 1);
}
int main (int argc, char **argv)
{
printf ("%s Endian System\n", (endian ())? "Big" : "Little");
return EXIT_SUCCESS;
}