bianjingzhanshi的专栏

<br />一次冒泡排序：<br /><br />#include <iostream><br />using namespace std;<br />typedef struct node<br />{<br /> int data;<br /> struct node *next;<br />}node, * linklist;<br /><br />linklist creat_l(linklist &l,int n);<br />void jisuan(linklist l,int n);<br /