![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
LouisGou
我很懒,什么都没有写
展开
-
单向链表(1)-创建
#include <stdio.h>#include <stdlib.h>struct node{ int date; struct node* next;};int main(){ struct node *p, *p1, *head; head = p = ( struct node* )malloc(sizeof(st...原创 2018-03-07 14:53:10 · 458 阅读 · 0 评论 -
基本算法
冒泡排序:for(int i = 0; i < (length - 1); i++){ for(int j = 0; j < (length -1 -i); j++) { if(score[j] < score[j+1]) { temp = score[j]; score[j] = ...原创 2018-03-11 14:41:47 · 190 阅读 · 0 评论