curr = L;
while ( curr->next != NULL)
{
if (curr->next->data < curr->data) return 0;
curr = curr->next;
}
return 1;