//1.冒泡排序:几十个元素排序就比较元素个数减一轮,比较次数,第一轮比较元素个数减一轮,而后每一轮再减一
int n[8] = { 1, 3, 5, 7, 9, 2, 4, 6 };
for (int i = 1; i < 8; i++)
{
for (int j = 0; j < 8 - i; j++)
{
int temp;
if (n[j]>n[j + 1])
{
temp = n[j];
n[j] = n[j + 1];
n[j + 1] = temp;
}
}
}
for (int i = 0; i < 8; i++)
{
cout << n[i] << endl;
}
//2.选择排序:利用for循环选择一个数字,逐一与后面的数进行比较大小
int m[5] = { 1, 3, 5, 6, 8 };
for (int i = 0; i < 4; i++)
{
for (int j = i + 1; j < 5; j++)
{
if (m[i] < m[j])
{
int temp;
temp = m[i];
m[i] = m[j];
m[j] = temp;
}
}
}
for (int i = 0; i < 5; i++)
{
cout << m[i] << endl;
}
//插入排序:
cout << "--------" << endl;
int c[5] = { 4, 6, 8, 9, 3 };
for (int i = 1; i < 5; i++)
{
int j = i - 1;
int temp = c[i];
for (; j >= 0; j--)
{
if (c[j]>temp)
{
c[j + 1] = c[j];
}
else
break;
}
if (i != j + 1)
{
c[j+1] = temp;
}
}
for (int i = 0; i < 5; i++)
{
cout << c[i] << endl;
}