init c_datatype

c_datatype/sisort.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include "sqlist.h"
+using namespace std;
+
+void InsertSort(SqList &L){
+	int i,j;
+	for(i=2;i<L.length;++i)
+		if (LT(L.elem[i].key,L.elem[i-1].key)){
+		L.elem[0] = L.elem[i];
+		L.elem[i] = L.elem[i-1];
+		for(j=i-2; LT(L.elem[i-1].key,L.elem[j].key); --j)
+			L.elem[j+1] = L.elem[j];
+		L.elem[j+1] = L.elem[0];
+		}
+}//InsertSort插入排序算法
+//未完成算法部分
+
+main(){
+	cout << "init\n" << endl;
+}

c_datatype/sqlist.h

@@ -0,0 +1,92 @@
+//数据结构－顺序线性表
+#include "malloc.h"
+#include "stdio.h"
+#include "stdlib.h"
+using namespace std;
+
+#define TRUE 1
+#define FALSE 0 
+#define OK 1
+#define ERROR 0
+#define INFEASIBLE -1
+#define OVERFLOW -2
+
+typedef int Status;
+typedef char ElemType;
+
+#define LIST_INIT_SIZE 100
+#define LISTINCREMENT 10
+typedef struct{
+	ElemType *elem;
+	int length;
+	int listsize;
+}SqList;
+
+Status InitList_Sq(SqList &L){
+	L.elem = (ElemType *)malloc(LIST_INIT_SIZE* sizeof(ElemType));
+	if(!L.elem) exit(OVERFLOW);
+	L.length = 0;
+	L.listsize = LIST_INIT_SIZE;
+	return OK;
+}//InitList_Sq
+
+Status ListInsert_Sq(SqList &L, int i,ElemType e){
+	ElemType *newbase,*p,*q;
+	if(i<1||i>L.length+1) return ERROR;
+	if(L.length>=L.listsize){
+		newbase = (ElemType *)realloc(L.elem,
+			(L.listsize+LISTINCREMENT) * sizeof (ElemType));
+		if(!newbase) exit(OVERFLOW);
+		L.elem = newbase;
+		L.listsize += LISTINCREMENT;
+	}
+	q= &(L.elem[i-1]);
+	for (p=&(L.elem[L.length-1]);p>=q;--p) *(p+1) = *p;
+	*q = e;
+	++L.length;
+	return OK;
+	}//ListInsert_Sq
+
+Status ListDelete_Sq(SqList &L,int i,ElemType &e){
+	ElemType *p,*q;
+	if((i<1)||(i>L.length)) return ERROR;
+	p = &(L.elem[i-1]);
+	e = *p;
+	q = L.elem + L.length - 1;
+	for(++p;p<=q;++p) *(p-1)=*p;
+	--L.length;
+	return OK;
+}
+
+Status LocateElem_Sq(SqList L,ElemType e,
+		Status(*compare)(ElemType,ElemType)){
+	ElemType *p;
+	int i = 1;
+	p = L.elem;
+	while(i<=L.length&&!(*compare)(*p++,e)) ++i;
+	if (i<=L.length) return i;
+	else return 0;
+}//LocateElem_Sq
+
+
+
+
+
+
+
+
+void MergeList_Sq(SqList La,SqList Lb,SqList &Lc){
+	ElemType *pa,*pb,*pc,*pa_last,*pb_last,*pc_last;
+	pa = La.elem; pb = Lb.elem;
+	Lc.listsize = Lc.length = La.length +Lb.length;
+	pc = Lc.elem =(ElemType*)malloc(Lc.listsize*sizeof(ElemType));
+	if(!Lc.elem)exit(OVERFLOW);
+	pa_last = La.elem + La.length -1;
+	pb_last = Lb.elem + Lb.length -1;
+	while (pa<=pa_last&&pb<=pb_last){
+	if(*pa<=*pb) *pc++=*pa++;
+	else *pc++ = *pb++;
+	}
+	while (pa <= pa_last) *pc++ = *pa++;
+	while (pb <= pb_last) *pc++ = *pb++;
+}//MergeList_Sq