广工anyview数据结构第三章2024

 目录

DC03PE01 计算升序直接插入排序中元素移动的次数

DC03PE03以L.rcd[L.length+1]作为监视哨，改写直接插入排序算法

DC03PE06改进冒泡排序算法

DC03PE23计数排序算法

---

DC03PE01 计算升序直接插入排序中元素移动的次数

int conflictsOfInsertSort(RcdSqList* L)
{ 
    int res = 0;
    for (int i=1; i < L->length; i++){
        if (L->rcd[i + 1].key < L->rcd[i].key){ 
            L->rcd[0] = L->rcd[i + 1];
            int j = i+1;
            do {
                j--;
                res++;
                L->rcd[j + 1] = L->rcd[j];
            } while (L->rcd[0].key < L->rcd[j - 1].key); 
            L->rcd[j] = L->rcd[0];
        }
    }
    return res;
}

DC03PE03以L.rcd[L.length+1]作为监视哨，改写直接插入排序算法

void InsertSort(RcdSqList &L)
{ // Add your code here
    for(int i=1;i<L.length;i++){
        if(L.rcd[i+1].key<L.rcd[i].key){
            L.rcd[L.length+1].key=L.rcd[i+1].key;
            int j=i+1;
            do{
                j--;
                L.rcd[j+1].key=L.rcd[j].key;
            }
            while(L.rcd[L.length+1].key<L.rcd[j-1].key);
            L.rcd[j].key=L.rcd[L.length+1].key;
        }
    }
}

DC03PE06改进冒泡排序算法

void BubbleSort(RcdSqList2 &L) 
{ // Add your code here
    int temp=0;
    for (int i=L.length; i > 1; --i){
        if (temp){
            i = temp;
            temp = 0;
        }   
        for (int j=1; j<i; j++){
            if (GT(L.rcd[j], L.rcd[j+1])){
                Swap(L.rcd[j], L.rcd[j+1]);
                temp = j;            
            }
        }
        if (temp == 0) return;
    }
}

DC03PE23计数排序算法

void CountSort(RcdSqList2 &L)  
{ // Add your code here
    RcdType k[MAXSIZE + 1];
    int c[MAXSIZE + 1];
    memset(c,0,sizeof(c));
    for (int i=1; i <= L.length; i++)
        for (int j=1; j <= L.length; j++)
            if (L.rcd[i].key > L.rcd[j].key) c[i]++;

    for (int i=1; i <= L.length; i++) k[i] = L.rcd[i];
    for (int i=1; i <= L.length; ++i) L.rcd[c[i]+1] = k[i];
}