- 博客(7)
- 收藏
- 关注
RSS订阅原创 二叉树基础
第一题#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>typedef struct Node{ int data; Node *left; Node *right;}Node;void createtree(Node **t,int n,int all[],int index){ if(index>=n) { (*t)=NULL;
2021-06-04 10:49:59
536
原创 链地址法哈希表c语言
#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct Node{ char key[200]; char value[200]; Node *next;}Node;unsigned int BKDRHash(char *str,int Hash_Size)//unsigned?{ unsigned int seed = 31; // 31 131 1313 1313
2021-05-24 15:52:33
300
原创 链地址法
#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct Node{char key[200];char value[200];Node *next;}Node;unsigned int BKDRHash(char *str,int Hash_Size)//unsigned?{unsigned int seed = 31; // 31 131 1313 13131 13131
2021-05-24 15:50:29
285
原创 快速排序c语言
#include<stdio.h>#include<stdlib.h>int getstandard(int all[],int left,int right){int key=all[left];while(left<right){while(left<right&&all[right]>=key){right–;}if(right>left){all[left]=all[right];}while(left&l
2021-05-20 13:46:52
65
原创 选择排序c语言顺序结构
#include<stdio.h>#include<stdlib.h>void swap(int &a,int &b){int temp=a;a=b;b=temp;}int main(){int i,n;scanf("%d",&n);int all[n];for(i=0;i<n;i++){scanf("%d",&all[i]);}for(i=0;i<n;i++){int j,index=i;for(j
2021-05-19 22:52:49
64
原创 希尔排序顺序结构C语言
#include<stdio.h>#include<stdlib.h>int main(){int gap,n,i,j,temp;scanf("%d",&n);int all[n]={0};for(i=0;i<n;i++){scanf("%d",&all[i]);}for(gap=n/2;gap>0;gap/=2){for(i=0;i<gap;i++){for(j=i+gap;j<n;j+=gap)//交换时不能再
2021-05-19 22:41:17
36
原创 插入排序（链式）c语言
#include<stdio.h>#include<stdlib.h>typedef struct Node{int data;Node *next;}Node;void init(Node *head){int i,n;Node *p=head;scanf("%d",&n);for(i=0;i<n;i++){Node *node=(Node *)malloc(sizeof(Node));scanf("%d",&node->da
2021-05-19 21:47:45
92
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人