woyouzai的博客

线形表分为：顺序存储（顺序表）和链式存储（链表）。而顺序表有分为：静态存储和动态存储，静态存储借助了一维数组来实现#define maxSize 10typedef int DataType;typedef struct {DataType data[maxSize];int n;}SeqList动态存储实现如下#define initSize 10type

Discription on Binary SearchThe binary search algorithm is used to search an element in the sorted array. It’s faster than linear search and improves perfomance from O(n) to O(logN) for searching an e