一、冒泡排序
C++代码:
#include<iostream>
using namespace std;
int bubblesort1A(int A[], int n)
{
bool sorted = false;
while (!sorted)
{
sorted = true;
for (int i = 1; i < n; i++)
{
if (A[i - 1] > A[i])
{
swap(A[i - 1], A[i]);
sorted = false;
}
}
n--;
}
return 0;
}
int main()
{
int A[] = { 10, 5, 7, 8, 6, 4, 6, 12, 40, 16 };
int len = sizeof(A) / sizeof(A[0]);
bubblesort1A(A, len);
for (int i = 0; i < len; i++)
{
cout << A[i] << " ";
}
cout << endl;
system("pause");
return 0;
}
python代码:
def bubble(alist):
for i in range(len(alist)-1, 0, -1):
for j in range(i):
if alist[j] > alist[j + 1]:
temp = alist[j]
alist[j] = alist[j + 1]
alist[j + 1] = temp
return alist
print(bubble(alist=[1,5,6,7,3,4,9]))
二、选择排序
C++代码:
template<class T>
void mySort(T arr[], int len)
{
for (int i = 0; i < len; i++)
{
int max = i; //认定最大值下标
for (int j = i + 1; j < len; j++)
{
//认定的最大值 比遍历的数值要小 ,说明j下标的元素才是真正的最大值
if (arr[max] < arr[j])
{
max = j; //更新最大值下标
}
}
if (max != i) //如果一开始认定的最大值和认定的最大值不相等
{
//交换max和i元素
mySwap(arr[max], arr[i]);
}
}
}
Python代码:
def selectionSort(alist):
for fillslot in range(len(alist) - 1,0,-1):
positionOfMax = 0
for location in range(1,fillslot + 1):
if alist[location] > alist[positionOfMax]:
positionOfMax = location
alist[positionOfMax],alist[location] = alist[location],alist[positionOfMax]
alist = [1,9,16,2,3,4,8,5]
selectionSort(alist)