Insertion Sort List

class Solution {
public:
    ListNode *insertionSortList(ListNode *head) {

        ListNode* ptr;
        ptr=head;

        while(ptr!=0)
        {
            ListNode* p;
            int tmp;
            p=head;

            while(p!=ptr&&ptr->val>p->val)
            {
                p=p->next;
            }

            ListNode* t;
            t=p;


                 while(p!=ptr)
               {
               tmp = t->val;
               t->val=p->next->val;
               p->next->val=tmp;
               p=p->next;
               }

            ptr=ptr->next;
        }
        return head;
    }
};