冒泡排序后分类相同ID的元素

1. #include  <stdio.h>
2. #include  <stdlib.h>
3. #include  <string.h>
4. /*******************************
5.   排序后分类相同ID的元素
6. ******************************/
8. struct USERCOMMSDTLS
9. {
10.     char  caUserId[20];
11.     int iCommsId;
12. };
14. int SortCommsID(struct USERCOMMSDTLS   saUserCommsDtls[],int  iNmbrOfUser)
15. {
16.    int iReturnValue = 0;
17.    int iUserCount = 0, iInnerCount=0, iCount = 0;
18.    bool bCmpr = false ;
19.    char caUserId[800];
20.    int iCommsid;
22.    for( iUserCount = 0; iUserCount < iNmbrOfUser; iUserCount++)
23.    {
24.       for(iInnerCount=iNmbrOfUser-1; iInnerCount>iUserCount; iInnerCount--) 
25.             {
26.         if(saUserCommsDtls[iInnerCount].iCommsId <= saUserCommsDtls[iInnerCount-1].iCommsId)
27.         {
28.           strcpy(caUserId,saUserCommsDtls[iInnerCount-1].caUserId);
29.                     iCommsid = saUserCommsDtls[iInnerCount-1].iCommsId;
30.                     strcpy(saUserCommsDtls[iInnerCount-1].caUserId,saUserCommsDtls[iInnerCount].caUserId);
31.           saUserCommsDtls[iInnerCount-1].iCommsId = saUserCommsDtls[iInnerCount].iCommsId;
32.           strcpy(saUserCommsDtls[iInnerCount].caUserId,caUserId);
33.                     saUserCommsDtls [iInnerCount].iCommsId = iCommsid;
34.           bCmpr = true;
35.         }
36.       }
37.       if(bCmpr = false)
38.         break;
39.    }
40.     return 0;
41.  }
43.  int main()
44.  {
45.     char userlist[90];
46.     int  iPrevCommsId = 0;
47.     int  i;
48.     memset(userlist,0,sizeof(userlist));
49.     USERCOMMSDTLS saUserCommsDtls[5]={"IRS_0",2,"CAT_0",4,"FRA_0",3,"IRS_1",2,"ETF_0",7};
50.     printf("%s,%d/n",saUserCommsDtls[0].caUserId,saUserCommsDtls[0].iCommsId);
51.     printf("%s,%d/n",saUserCommsDtls[1].caUserId,saUserCommsDtls[1].iCommsId);
52.     printf("%s,%d/n",saUserCommsDtls[2].caUserId,saUserCommsDtls[2].iCommsId);
53.     printf("%s,%d/n",saUserCommsDtls[3].caUserId,saUserCommsDtls[3].iCommsId);
54.     printf("%s,%d/n",saUserCommsDtls[4].caUserId,saUserCommsDtls[4].iCommsId);
55.     printf("**************************/n");
56.     SortCommsID(saUserCommsDtls,5);
57.     printf("%s,%d/n",saUserCommsDtls[0].caUserId,saUserCommsDtls[0].iCommsId);
58.     printf("%s,%d/n",saUserCommsDtls[1].caUserId,saUserCommsDtls[1].iCommsId);
59.     printf("%s,%d/n",saUserCommsDtls[2].caUserId,saUserCommsDtls[2].iCommsId);
60.     printf("%s,%d/n",saUserCommsDtls[3].caUserId,saUserCommsDtls[3].iCommsId);
61.     printf("%s,%d/n",saUserCommsDtls[4].caUserId,saUserCommsDtls[4].iCommsId);
62.     printf("**************************/n");
64.     iPrevCommsId = 0;
65.     for(i=0;i<5;i++)
66.     {
67.      if(iPrevCommsId != saUserCommsDtls[i].iCommsId )
68.      {            /** Send to Comms **/
69.             printf("userlist:%s/n",userlist);
70.             memset(userlist,0,sizeof(userlist));
71.             iPrevCommsId = saUserCommsDtls[i].iCommsId;
72.             strcpy(userlist, saUserCommsDtls[i].caUserId);              
73.      }
74.      else if(saUserCommsDtls[i].iCommsId == iPrevCommsId)
75.      {
76.        strcat(userlist, "|");
77.        strcat(userlist, saUserCommsDtls[i].caUserId);
78.        iPrevCommsId = saUserCommsDtls[i].iCommsId;
79.      }
80.    }
81.     if(strlen(userlist) != 0)
82.      printf("userlist:%s/n",userlist);
84.    return 0;
85.  }