电话帐单交款算法

最新推荐文章于 2024-09-12 19:02:20 发布

Micro_lee

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量1.1k

点赞数

文章标签：电话算法 struct merge n2 null

本文链接：https://blog.csdn.net/Micro_lee/article/details/1451543

版权

//**********************************************
//
//             电话帐单交款算法
//             xwlee 2006/12/20
//**********************************************
#include<iostream>
#include<ctime>
#include <iomanip>
using namespace std;
const int N = 100;

struct phone{
    int phone_num;
    int flag;
};

void Merge(struct phone a[],int p,int q,int r);
void Merge_Sort(struct phone a[],int p,int r);
int main()
{
    struct phone my_phone[N];

    int i;
    srand( (unsigned)time( NULL ) );//srand()函数产生一个以当前时间开始的随机种子
    for(i=0; i<N;i++)
    {
        while( (my_phone[i].phone_num=rand()%1000000)<10000 )
        ;
        my_phone[i].flag=rand()%2;
    }


    cout<<"原始n张电话帐单:"<<endl;
    for(i=0; i < N; i++)
      cout<<"No."<<setw(5)<<i<<" 电话号码:"<<setw(10)<<my_phone[i].phone_num<<" 是否交款(1/0)："<<my_phone[i].flag<<endl;

    Merge_Sort(my_phone,0,N);
    cout<<endl<<endl<<"预排序后n张电话帐单:"<<endl;
    for(i=0; i < N; i++)
      cout<<"No."<<setw(5)<<i<<" 电话号码:"<<setw(10)<<my_phone[i].phone_num<<" 是否交款(1/0)："<<my_phone[i].flag<<endl;

    return 0;
}

void Merge(struct phone a[],int p,int q,int r)
{
    int n1 = q - p + 1;
    int n2 = r - q;
    struct phone *L = new struct phone[n1];
    struct phone *R = new struct phone[n2];
    int i = 0;
    int j = 0;

    for(int m=0; m<n1; m++)
    {
        L[m].phone_num = a[p+m].phone_num;
        L[m].flag = a[p+m].flag;
    }
    for(int n=0; n<n2; n++)
    {
        R[n].phone_num = a[q+n+1].phone_num;
        R[n].flag = a[q+n+1].flag;
    }
    int k = p;
    for(k; k<=r; k++)
    {
    if(L[i].phone_num <= R[j].phone_num)
    {
       a[k].phone_num = L[i].phone_num;
       a[k].flag = L[i].flag;
       i++;
    }
    else
    {
      a[k].phone_num = R[j].phone_num;
      a[k].flag = R[j].flag;
    j++;
    }
    if((i >= n1) || (j >= n2))
    break;
}
    while(i >= n1 && j < n2)      //when one side is over,
    {
        k++;
        a[k].phone_num = R[j].phone_num;
        a[k].flag = R[j].flag;
        j++;
    }
    while(i < n1 && j >= n2)
    {
        k++;
        a[k].phone_num = L[i].phone_num;
        a[k].flag = L[i].flag;
        i++;
    }
}

void Merge_Sort(struct phone a[],int p,int r)
{
int q;
if(p < r)
{
q = (p + r) / 2;
Merge_Sort(a,p,q);
Merge_Sort(a,q + 1,r);
Merge(a,p,q,r);
}
}