Hash_Function_Shift_Folding_Linked_List.c
/*
This function adds new node to the end of the linked list
*/
This function adds new node to the end of the linked list
This function adds new node to the end of the linked list
void add_end(node_t * head, fakeNum newNumber)
{
	node_t * current = head;
	while (current->next != NULL)
	{
		current = current->next;
	}
	current->next = malloc(sizeof(node_t));
	current->next->number = newNumber;
	current->next->next = NULL;
}
void add_end ( node_t * head , fakeNum newNumber ) { node_t * current = head ; while ( current -> next != NULL ) { current = current -> next ; } current -> next = malloc ( sizeof ( node_t ) ) ; current -> next -> number = newNumber ; current -> next -> next = NULL ; }
This function adds new node to the end of the linked list
This function adds new node to the end of the linked list
/* now we can add a new variable */