C++:
void bubble(int *pdata,int length) //冒泡排序
{
for (int i = 0; i <length; i++)
{
for(int j = 0;j <length-i-1;j++)
{
if(pdata[j]>pdata[j+1];
swap(pdata[j], pdata[j+1]);
}
}
}
python:
def bubble():
a = [1,3,2,6,8,4,9]
count = len(a)
for i in range(count):
for j in range(i+1,count):
# if a[i]<a[j]:
# a[i],a[j]=a[j],a[i]
if a[i]>a[j]:
a[i],a[j] = a[j],a[i]
return a
def bubble():
a = [1,3,4,2,5,8,9,6]
for i in range(len(a)):
for j in range(i,len(a)):
if a[i]>a[j]:
a[i],a[j] = a[j],a[i]
print a
bubble()
快排C++:
void quickSort(int s[], int l, int r) //快排 { if (l< r) { int i = l, j = r, x = s[l]; while (i < j) { while(i < j && s[j]>= x) // 从右向左找第一个小于x的数 j--; if(i < j && s[j] < x) //若从右往左找到比x小的值,则s[i] = s[j],同时i++ s[i++] = s[j]; while(i < j && s[i]< x) // 从左向右找第一个大于等于x的数 i++; if(i < j && s[i] >= x) s[j--] = s[i]; } s[i] = x; quickSort(s, l, i - 1); // 递归调用 quickSort(s, i + 1, r); } }