专业外贸网站制作,wordpress付费剧集网站,龙岩网络图书馆,网址大全qq浏览器线性表中各节点的检索概率不等时#xff0c;可用如下策略提高顺序检索的效率#xff1b;若找到指定的结点#xff0c;则将该结点和其前驱结点#xff08;若存在#xff09;交换#xff0c;使得经常被访问的结点尽量位于表的前端。试设计在顺序结构和链式结构的线性表盘上… 线性表中各节点的检索概率不等时可用如下策略提高顺序检索的效率若找到指定的结点则将该结点和其前驱结点若存在交换使得经常被访问的结点尽量位于表的前端。试设计在顺序结构和链式结构的线性表盘上实现上述策略的顺序检索算法。 #include iostreamtypedef struct node{struct node* next;int data;
}node,*pnode;pnode buynode(int x)
{pnode tmp(pnode) malloc(sizeof (node));tmp-datax,tmp-next nullptr;return tmp;
}
typedef struct link_list{pnode head;
}link_list;void init_array(int* data,int size)
{printf(the original array is:);for(int i0;isize;i) data[i]i1, printf(%3d,data[i]);puts();
}void print(int*data,int size)
{for(int i0;isize;i) printf(%3d,data[i]);puts();
}
int array_visit(int* data,int size,int search)
{for(int i0;isize;i){if(data[i]searchi!0){data[i]data[i-1];data[i-1]search;printf(after find number %3d:,search);print(data,10);return i-1;}if(data[i]searchi0) return 0;}return -1;}
void link_init(link_list l,int size)
{l.head buynode(-1);pnode tmpl.head;for(int i0;isize;i) tmp-next buynode(i1),tmptmp-next;
}int link_find(link_list l ,int search)
{pnode tmpl.head;int count0;while(tmp-next){if(tmp-next-datasearch){if(tmp-data-1) return count;else{tmp-next-datatmp-data;tmp-datasearch;return count-1;}}else{count;tmptmp-next;}}return -1;
}void print_list(link_list l)
{for(pnode tmpl.head-next;tmp;tmptmp-next){printf(%3d,tmp-data);}puts();
}
int main() {//顺序表int * data(int*) malloc(sizeof (int)*10);init_array(data,10);for(int i0;i5;i){int p1 array_visit(data,10,5);printf(the position of 5 is :%3d\n,p1);}for(int i0;i5;i){int p1 array_visit(data,10,10);printf(the position of 10 is :%3d\n,p1);}printf(-------------------------------------------------\n);//链表link_list l1;link_init(l1,10);print_list(l1);for(int i0;i5;i){int p1 link_find(l1,5);printf(the position of 5 is :%3d\n,p1);print_list(l1);}for(int i0;i5;i){int p1 link_find(l1,10);printf(the position of 10 is :%3d\n,p1);print_list(l1);}return 0;
}对于顺序结构上的测试结果 在链式结构上的搜索结构
