数据结构
niehui61
这个作者很懒,什么都没留下…
展开
-
插入排序
#includeusing namespace std;int main(){ int a[8] = {43,18,39,35,17,20,33,34}; int temp,j; for(int i = 1;i { temp = a[i]; j = i-1; while(j>=0&&a[j]原创 2016-05-30 21:36:27 · 255 阅读 · 0 评论 -
折半插入排序
#includeusing namespace std;int main(){ int a[8] = {43,18,39,35,17,20,33,34}; int temp,j,high,low,mid; for(int i=1;i { temp = a[i]; low = 0; high =原创 2016-05-30 21:56:19 · 191 阅读 · 0 评论 -
冒泡排序
#includeusing namespace std;int main(){ int a[8] = {43,18,39,35,17,20,33,34}; int temp,j,high,low,mid; for(int i=0;i { for(j=0;j { if(a[j原创 2016-05-30 22:13:18 · 219 阅读 · 0 评论