冒泡排序

1. //冒泡排序    
2. private List<Shop> pocektSort(List<Shop> shops)
3.     {
4.         int temp;
5.         for (int i = 0; i < shops.Count; i++)
6.         {
7.             for (int j = 0; j < shops.Count - i - 1; j++)
8.             {
9.                 if (shops[j].Credit < shops[j + 1].Credit)
10.                 {
11.                     temp = shops[j + 1].Credit;
12.                     shops[j + 1] = shops[j];
13.                     shops[j] = temp;
14.                 }
15.             }
16.         }
17.         return shops;
18.     }
20.     private int findCredit(Shop shop,List<Shop> shops)
21.     {//搜索排名
22.         int i = 1;
23.         foreach (Shop s in shops)
24.         {
25.             if (shop.Credit == s.Credit)
26.             {
27.                 return i;
28.                 break;
29.             }
30.             else
31.             {
32.                 i++;
33.             }
34.         }
35.         return -1;
36.     }