冒泡排序算法

C++ #include using namespace std; void swap(int &a, int &b) { a = a + b; b = a - b; a = a - b; } void ergodic(int *p,int length) { for (int i = 0; i < length; i++) { cout << p[i] << " "; } }

void BubbleSort(int *p, int length) { for (int i = 0; i < 10; i++) { for (int j = 0; j < 10 - i - 1; j++) { if (p[j] > p[j + 1]) { swap(p[j], p[j + 1]); } } } }

int main(int argc, char *args[]) { int buf[10] = { 12, 4, 34, 6, 8, 65, 3, 2, 988, 45 }; int m = sizeof(buf); cout << "排序前:" << endl; ergodic(buf,sizeof(buf)/sizeof(int));

BubbleSort(buf, sizeof(buf) / sizeof(int));

cout << "\n\n\n排序后：" << endl;
ergodic(buf, sizeof(buf) / sizeof(int));
getchar();

}

虽然冒泡算法是很基本的算法 但你想让大家做什么呢,,,,,,

从小到大的排序
class Program
{
public static void Sort(int[] myArray)
{
// 取长度最长的词组 -- 冒泡法
for (int j = 1; j < myArray.Length;j++)
{
for (int i = 0; i < myArray.Length - 1; i++)
{
// 如果 myArray[i] > myArray[i+1] ，则 myArray[i] 上浮一位
if (myArray[i] >myArray[i + 1])
{
int temp = myArray[i];
myArray[i] = myArray[i + 1];
myArray[i + 1] = temp;
}
}
}
}
static void Main(string[] args)
{
int[] myArray = new int[] { 10, 8, 3, 5, 6, 7, 4, 6, 9 };
Sort(myArray);
for (int m = 0; m < myArray.Length; m++)
{
Console.WriteLine(myArray[m]);
}
}

从大到小的排序
class Program
{
public static void Sort(int[] myArray)
{
// 取长度最长的词组 -- 冒泡法
for (int j = 1; j < myArray.Length;j++)
{
for (int i = 0; i < myArray.Length - 1; i++)
{
// 如果 myArray[i] < myArray[i+1] ，则 myArray[i] 下沉一位
if (myArray[i] < myArray[i + 1])
{
int temp = myArray[i];
myArray[i] = myArray[i + 1];
myArray[i + 1] = temp;
}
}
}
}
static void Main(string[] args)
{
int[] myArray = new int[] { 10, 8, 3, 5, 6, 7, 4, 6, 9 };
Sort(myArray);
for (int m = 0; m < myArray.Length; m++)
{
Console.WriteLine(myArray[m]);
}
}