排序算法
Yo3ngLau
Grazie
展开
-
冒泡排序
冒泡排序 #include <iostream> using namespace std; typedef int ElementType; void Bubble_Sort(ElementType A[], int N); int main() { int N; cin >> N; ElementType *A = (ElementType*)malloc(N * ...原创 2019-04-09 15:27:42 · 82 阅读 · 0 评论 -
插入排序
插入排序 #include <iostream> using namespace std; typedef int ElementType; void Insert_Sort(ElementType A[], int N); int main() { int N; cin >> N; ElementType *A = (ElementType*)malloc(N * ...原创 2019-04-09 15:27:24 · 97 阅读 · 0 评论 -
选择排序
选择排序 #include <iostream> using namespace std; typedef int ElementType; void Selection_Sort(ElementType A[], int N); int main() { int N; cin >> N; ElementType *A = (ElementType*)malloc(N...原创 2019-04-09 15:27:32 · 83 阅读 · 0 评论 -
希尔排序
希尔排序 #include <iostream> using namespace std; typedef int ElementType; void Shell_Sort(ElementType A[], int N); int main() { int N; cin >> N; ElementType *A = (ElementType*)malloc(N * s...原创 2019-04-09 15:27:16 · 117 阅读 · 0 评论