Ejemplos de length_linked_list en C++ (Cpp)

Ejemplo n.º 1

Archivo: main.c Proyecto: yogishathegreat/Datastructures

int main ( int argc, char *  args[])
{


node *head = NULL;

head = delete_at_end(head);
head = delete_at_first(head);
head = delete_at_position(head, 66);

head = insert_at_position (head, 2, 5 );
head = insert_at_first (head, 4 );
head = insert_at_position (head, 2, 3 );
head = insert_at_position (head, 2, 2 );
head = insert_at_position (head, 2, 1 );
print_linked_list (head);

head = delete_at_first(head);
head = delete_at_end(head);
head = delete_at_position (head, 2);
head = delete_at_position (head, 2);
head = delete_at_position (head, 2);


print_linked_list (head);
printf ("the length is %d\n" ,length_linked_list(head));

//printf ("successfully deleted list : %d\n", purge_linked_list(head));

return SUCCESS;
}

Ejemplo n.º 2

Archivo: linked_list.cpp Proyecto: KangarooGitHub/Repository1

void sort_linked_list(PNODE phead)
{
	PNODE p,q;
	int i,j,tmp;
	int len = length_linked_list(phead);
	for (i=0,p = phead->pnext;i<len-1;i++,p = p->pnext)
	{	
		for (j=i+1,q = p->pnext;j<len;j++,q=q->pnext)
		{			
			if ((p->data) > (q->data))
					{
						tmp = p->data;
						p->data = q->data;
						q->data = tmp;
					}
		}
	}
	traverse_linked_list(phead);
}