摘要:
顺序表的查找: 直接循环依次和目标比较就行 有序表的查找(二分查找): int search(SS *T,Type key){ int mid; int low=1; int high=T.length; while(lowdata); while(front!=rear){ BTNode *p; p=Q[++fro... 阅读全文
摘要:
#include #include #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define OVERFLOW -1 #define STACK_INIT_SIZE 100 #define STACKINCREMENT 10 typedef int Status; typedef char ElemType; ty... 阅读全文