为什么升序实现不了，而降序可以，求大佬指点

大佬指点"/>

为什么升序实现不了，而降序可以，求大佬指点

链表实现排序

//当0时，升序case 0:{//需要三个辅助指针struct LinkNode * pcurrent = Header->next;struct LinkNode * pReview = pcurrent->next;//记录pcurrentstruct LinkNode * pbehind = pcurrent;//冒泡排序for (a = 0; a < count - 1; a++){for (b = 0; b < count - 1 - a; b++){if ((pcurrent->data)>(pReview->data)){temp = pcurrent->data;pcurrent->data = pReview->data;pReview->data = temp;}//往下继续比较pcurrent = pReview;pReview = pReview->next;}//重置，使下个数进行比较pcurrent = Header->next;pReview = pbehind->next;}}//降序case 1:{//需要三个辅助指针struct LinkNode * pcurrent = Header->next;struct LinkNode * pReview= pcurrent->next;//记录pcurrentstruct LinkNode * pbehind = pcurrent;//冒泡排序for (a = 0; a < count -1 ; a++){for (b = 0; b < count - 1 - a; b++){if ((pcurrent->data) < (pReview->data)){temp = pcurrent->data;pcurrent->data = pReview->data;pReview->data = temp;}//往下继续比较pcurrent = pReview;pReview = pReview->next;}//重置，使下个数进行比较pcurrent = Header->next;pReview=pbehind->next;}}