06 2012 档案

摘要：//散列表之链表散列#include <stdio.h>#include <string.h>#include "linux_list.h"#define m 7struct record{struct list_head list;int id;char name[10];};int Record_value(char *str,struct record *rec);int main(void){int i,j,n;struct list_head *hash;char str[100];FILE *fp;struct record *a;has 阅读全文

摘要：#include <stdio.h>void merge(int *const a,int p,int q, int r);void merge_sort(int a[],int p,int r);int main(void){int j;int arraynumber[]={3,5,1,2,0,-1,-3,7,9,8};int len=sizeof(arraynumber)/sizeof(int);merge_sort(arraynumber,0,len-1);for(j=0;j<len;j++)printf("%d\n",arraynumber[j]) 阅读全文

摘要：#include <stdio.h>void sort( int * const arraynumber,int len);int main(void){int j;int arraynumber[]={3,5,1,4,2,9,4,6,3,8,7,0};int len=sizeof(arraynumber)/sizeof(int);sort(arraynumber,len);for(j=0;j<12;j++)printf("%d\n",arraynumber[j]);return 0;}void sort(int *const arraynumber,in 阅读全文

摘要：#include <stdio.h>void sort( int * const arraynumber,int len,int *head);int main(void){int j;int arraynumber[]={3,5,1,4,2,9,4,6,3,8,7,0,-1,-3};int len=sizeof(arraynumber)/sizeof(int);int sortarray[len];sort(arraynumber,len,sortarray);for(j=0;j<len;j++)printf("%d\n",sortarray[j]);r 阅读全文