摘要：冒泡排序 #include <stdio.h> 阅读全文

摘要：#include<stdio.h>#include<stdlib.h>#define LIST_MAX 10#define LIST_ADD 2typedef struct { int *elem; int length; int listsize;}SqList;int InitList(SqLi 阅读全文

摘要：#include<stdio.h>#include<stdlib.h>typedef struct { int *elem; int length; int listsize;}SqList;#define LIST_MAX 10#define LIST_ADD 2int InitList(SqLi 阅读全文

摘要：#include<stdio.h>#include<stdlib.h>int InitTriplet(int **T,int v1,int v2,int v3){ *T=(int*)malloc(3*sizeof(int)); if(!*T) { printf("分配空间失败!\n"); exit( 阅读全文