算法导论-排序的Python&C++简单实现
2017-09-14 20:56
609 查看
引自《算法导论》:
==============================================
#include<iostream>
using namespace std;
int main()
{
int A[10];
cout << "input six numbers:" << endl;
for (int i = 1; i <= 6; i++)
{
cin >> A[i];
}
int key,k;
for (int j = 2; j <= 6; j++)
{
key = A[j];
k = j - 1;
while (k > 0 && A[k] > key)
{
A[k + 1] = A[k];
k = k - 1;
}
A[k + 1] = key;
}
for (int i = 1; i <= 6; i++)
{
cout << A[i] <<" ";
}
return 0;
}
=================================================
Python:
A = [5,2,4,6,1,3]
for j in range
4000
(1,len(A)):
key = A[j]
i = j - 1
while i >= 0 and A[i] > key:
A[i + 1] = A[i]
i = i - 1
A[i + 1] = key
print(A)
===============================================
==============================================
#include<iostream>
using namespace std;
int main()
{
int A[10];
cout << "input six numbers:" << endl;
for (int i = 1; i <= 6; i++)
{
cin >> A[i];
}
int key,k;
for (int j = 2; j <= 6; j++)
{
key = A[j];
k = j - 1;
while (k > 0 && A[k] > key)
{
A[k + 1] = A[k];
k = k - 1;
}
A[k + 1] = key;
}
for (int i = 1; i <= 6; i++)
{
cout << A[i] <<" ";
}
return 0;
}
=================================================
Python:
A = [5,2,4,6,1,3]
for j in range
4000
(1,len(A)):
key = A[j]
i = j - 1
while i >= 0 and A[i] > key:
A[i + 1] = A[i]
i = i - 1
A[i + 1] = key
print(A)
===============================================
相关文章推荐
- 算法导论-分治法-合并排序的Python&C++实现
- 排序算法的C++ && Python实现---希尔排序(缩小增量排序)
- 排序算法的C++ && Python实现---选择排序
- 快速排序的c++实现 和 python 实现
- C++实现简单插入排序
- C++ 简单实现MFC ListControl 点击列头排序
- Python实现冒泡,插入,选择排序简单实例
- 用C++实现七种排序算法,可选择排序方法,简单易懂。
- 归并排序的简单实现(c++ 版本)
- [C++ && Python]简单模拟代码评测系统
- BST && TREAP 实现简单排序
- Unreal Engine 4 AI (二)用C++和Behavior Tree & Blackboard 实现简单追踪AI
- c++&&python实现Hadoop Streaming的partitioner和模块化
- 归并排序的简单实现(c++ 版本)
- C++ 简单实现MFC ListControl 点击列头排序
- C++实现简单的排序
- 算法导论 - QuickSort 快速排序 C++实现
- 简单实现Socks5代理(Python&C#)
- 【Python】简单例题tuple和list的转换;实现删除一个list里重复的元素;对list a进行排序,并且从最后一个开始删除重复元素
- 算法导论-第六章-堆排序:基于最大堆的排序C++实现