随笔分类 -  数据结构

摘要:#include using namespace std;int a[]={3, 2, 5, 1, 4, -3, 24, 7};int *p = new int[8];void bubble_sort(int n) { for (int i = 0; i a[j]) { int tmp = a[j - 1]; a[j - 1] = a[j]; a[j] = tmp; } } }}void select_sort(int n) { for (int i... 阅读全文
posted @ 2014-01-09 10:39 xiaovid 阅读(345) 评论(0) 推荐(0)