狭义算法与广义算法
狭义的算法是与数据的存储方式密切相关;
广义的算法是与数据的存储方式无光
基础知识
线性存储:数组连续;链表非连续
数组
狭义算法数组排序
void sort_arr(void){int arr[8] = {1,2,5,6,8,9,18,16 };int i, j;int len = 8;int* head,*head_next ;// 从小到大排序for (i = 0;i < len - 1;i++){for (j = i + 1;j < len;j++){if (arr[i] > arr[j]){int t = arr[i];arr[i] = arr[j];arr[j] = t;}}}}
狭义算法链表排序
typedef struct node{//数据域 int data;//指针域struct node* pnext;}*PNODEstruct node*phead=NULL;(这里创建一个链表){伪代码phead=}void sort_list(PNODE phead){//struct node* head = phead->pnext;if (is_emptys(phead)){cout<<"链表为空,不能进行排序"<<endl;return;}PNODE p, q;int i ,j ;int len = length_list(phead);for(i=0,p=phead->pnext;i<len-1;++i,p=p->pnext)for (j = i+1,q=p->pnext;j <len;++j,q=q->pnext){//cout <<"q->data; " << q->data << endl;if (p->data > q->data){int t = p->data;//t = a[i];p->data = q->data;q->data = t;}}return;}
现在我们大胆的走一步,看清指针的本质就是内存,狭义算法推导广义的算法
void sort_arr(void){int arr[8] = {1,2,5,6,8,9,18,16 };int i, j;int len = 8;int* head,*head_next ;// 从小到大排序for (i = 0;i < len - 1;i++){for (j = i + 1;j < len;j++){if (arr[i] > arr[j]){int t = arr[i];arr[i] = arr[j];arr[j] = t;}}}*这里的head指的就是数组首地址,换言之就是存放数组的首地址内存;**head_next就是两个相邻的数,第二个数字的地址*for (i = 0, head = arr;i < len - 1;i++, head = head + 1){for (j = i + 1, head_next = head+1;j < len;j++,head_next=head_next+1){if (*head < *head_next){int t = *head;*head = *head_next;*head_next = t;}}}for(int i=0;i<len;i++){cout << arr[i] << endl;}}