bubble sort func. for singly linked lists

// bubble sort func. for singly linked list

void sort(nodePtr node) {
    nodePtr temp = node; bool flag = true;
    while (flag) {
        flag = false;
        while (node->next != NULL) {
            if (node->data > node->next->data) {
                swap(node->data, node->next->data);
                flag = true;
            }
            node = node->next;
        }
        node = temp;
    }
}