Sistemi di Calcolo: EsempiCG17

Revision [2656]

Last edited on 2017-01-20 18:25:52 by CamilDemetrescu

Additions:

for (i = 0; i < 3; i++)

Deletions:

~~for (i = 0; i < 4; i++)~~

Revision [2655]

Edited on 2017-01-20 17:30:58 by CamilDemetrescu

Additions:

for (i = 0; i < 4; i++)

Deletions:

~~for (i = 0; i < 5; i++)~~

Revision [2654]

Edited on 2017-01-20 13:06:14 by CamilDemetrescu

No differences.

Revision [2653]

Edited on 2017-01-20 13:06:03 by CamilDemetrescu

Additions:

int a = 39, n = 1, k = 0;
while (a & n) {
k++;
n *= 2;
printf("%d", k);

Revision [2652]

Edited on 2017-01-20 13:01:06 by CamilDemetrescu

Additions:

char b = 1;
while(b <= 127) {
printf("%u\n", (unsigned int) b);
b++;

Revision [2651]

Edited on 2017-01-20 12:27:45 by CamilDemetrescu

Additions:

bar(n / 2 + ((n + 1 * 2 % 3 == 0) ? 1 : 0));

Deletions:

~~bar(n / 2 + (n + 1 * 2 % 3 == 0 ? 1 : 0));~~

Revision [2650]

Edited on 2017-01-20 11:30:05 by CamilDemetrescu

Additions:

if (n == NULL) exit(1);
if (list == NULL) exit(1);
if (list == NULL) exit(1);
while (tail->next != NULL) tail = tail->next;

Deletions:

#define MAX_N_ELEM_NODE 8
if (n == NULL) {
printf("Allocation error\n");
exit(1);
if (list == NULL) {
printf("Invalid list!\n");
exit(1);
if (list == NULL) {
printf("Invalid list!\n");
exit(1);
while (tail->next != NULL)
tail = tail->next;

Revision [2649]

Edited on 2017-01-20 11:27:27 by CamilDemetrescu

Additions:

#define MAX_N_ELEM_NODE 8
typedef struct node_t {
struct node_t * next;
int data;
} node_t;
typedef struct linked_list_t {
node_t * head;
} linked_list_t;
static node_t* new_node() {
node_t *n = malloc(sizeof(node_t));
if (n == NULL) {
printf("Allocation error\n");
exit(1);
n->next = NULL;
return n;
static linked_list_t* new_linked_list() {
linked_list_t *list = malloc(sizeof(linked_list_t));
if (list == NULL) {
printf("Invalid list!\n");
exit(1);
list->head = NULL;
return list;
static void append_elem(linked_list_t *list, int x) {
if (list == NULL) {
printf("Invalid list!\n");
exit(1);
if (list->head == NULL) {
list->head = new_node();
list->head->data = x;
} else {
node_t *tail = list->head;
while (tail->next != NULL)
tail = tail->next;
tail->next = new_node();
tail->next->data = x;
void delete_linked_list(linked_list_t *list) {
node_t *n = list->head;
while (n != NULL) {
free(n);
n = n->next;
linked_list_t * l = new_linked_list();
append_elem(l, 666);
append_elem(l, 333);
append_elem(l, 111);
delete_linked_list(l);

Revision [2648]

Edited on 2017-01-20 11:23:44 by CamilDemetrescu

Additions:

#include
int i, * data[10];
for (i = 0; i < 10; i++)
data[i] = malloc(sizeof(int) * 10);
printf("%ld\n", (long int) (data + 3) - (long int) (data + 1));

Revision [2647]

Edited on 2017-01-18 19:18:20 by CamilDemetrescu

Additions:

void knock_knock(char * s) {
while (*s++ != '\0')
printf("Bazinga");
int data[5] = { -1, -3, 256, -4, 0};
knock_knock((char *) data);

Revision [2646]

Edited on 2017-01-18 18:39:35 by CamilDemetrescu

Additions:

void swappiness(int a, int b, int * c, int * d) {
int * e = c;
c = d;
d = e;
int f = a;
a = b;
b = f;
f = a;
a = b;
b = f;
int a = 10, b = 20;
swappiness(a, b, &b, &a);
printf("%d %d\n", a, b);

Revision [2645]

Edited on 2017-01-18 18:18:41 by CamilDemetrescu

Additions:

void foo(int** a) {
int i;
for (i = 0; i < 5; i++)
(*a)++;
void bar(int* a) {
foo(&a);
printf("%d\n", *(a + 1));
int data[4] = { 1, 2, 3, 4 };
bar(data);

Revision [2644]

Edited on 2017-01-18 18:13:44 by CamilDemetrescu

Additions:

%%(c)

Deletions:

~~%%(C)~~

Revision [2643]

The oldest known version of this page was created on 2017-01-18 18:13:37 by CamilDemetrescu