/* 冒泡排序 */ #include <iostream> using namespace std; //从小到大排序 void bubbleSort(int array[], int n) { int i, j; bool flag = true; for (i = 0; i < n; i++) { flag = false; for (j = n -1; j > i; j--) { if (array[j] < array[j-1]) { swap(array[j],array[j-1]); flag = true; } } if (!flag) break; } } int main() { int a[10] = {1, 2, 5, 4, 3, 9, 8, 0, 7, 6}; bubbleSort(a, 10); for (int i = 0; i < 10; i++) { cout << a[i] << " "; } cout << endl; return 0; } /* 建立二叉树,并中序遍历 */ #include <iostream> using namespace std; struct TreeNode { int num; TreeNode *lchild; TreeNode *rchild; }; TreeNode* createTree() { TreeNode* root; int num; cin >> num; if (!num) root = NULL; else { root = new TreeNode; root->num = num; root->lchild = createTree(); root->rchild = createTree(); } return root; } void preOrder(TreeNode* p) { if (!p) return ; preOrder(p->lchild); cout << p->num << " "; preOrder(p->rchild); } int main() { TreeNode* root; root = createTree(); preOrder(root); return 0; } PS:代码是本人自己编写仅供参考