向有序循环单向链表中插入节点

class Node
{
public:
Node(int v)
{
value = v;
next = NULL;
}
int value;
Node *next;
};

void insertNode(Node* aNode, int x)
{
if (aNode == NULL)
{
aNode = new Node(x);
aNode->next = NULL;
return;
}

Node *start = aNode;
Node *cur = aNode;
Node *next = aNode->next;
while (next != start)
{
if ((x >= cur->value) && (x <= next->value))
{
break;
}
if (((x >= cur->value) || (x <= next->value)) && (cur->value >= next->value))
{
break;
}

cur = next;
next = cur->next;
}

Node *newNode = new Node(x);
newNode->next = next;
cur->next = newNode;
}