数据结构学习笔记<三>数据结构算法2.2具体实现

来源：互联网发布：安卓省流量软件编辑：程序博客网时间：2024/06/04 21:45

#include <stdio.h>typedef int List;int  MergeList(List *La, List *Lb,List **Lc,List La_len,List Lb_len){//已知线性表La和Lb中的数据元素按值非递减排列 // 归并La和Lb得到新的线性表Lc，Lc的元素也按值非递减排列。*Lc = (List *)malloc(sizeof(List)*15);if(!*Lc) printf("%c","失败"); static int i=0,j=0,k=0;//printf("%d\n",strlen(La));/*int a[5]={1,3,5,7,9};int b[5]={0,2,4,6,8};*/while((i<La_len)&&(j<Lb_len)){//printf("%d",La[i]);if(La[i]<=Lb[j]){//printf("%d",La[i]);Lc[k] = La[i];k++;++i;}else{Lc[k] = Lb[j];k++;++j;}}while(i< La_len){Lc[k] = La[i];k++;++i;}while(j < Lb_len){Lc[k] = Lb[j];k++;++j;}} int main(int argc, char *argv[]){int a[5]={1,3,5,7,9};int b[5]={0,2,4,6,8};int La_len,Lb_len;La_len = sizeof(a) / 4;Lb_len = sizeof(b) / 4;int p = 12;int *q = &p;int **c = &q;MergeList(a,b,c,La_len,Lb_len);//printf("%d\n",sizeof(a) / 4);int i = 0;for(i;i<10;i++){printf("%d\n",c[i]);}return 0;}

<img src="http://img.blog.csdn.net/20141123152304078?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvYTgyMTIzNTgzNw==/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

注:这个程序没有动态拓展数组Lc的长度

0 0