几种排序

例 //鸽巢排序
int main()
{
int a[] = {0,2,3,4,0,7,6,5,3,6,2,7,8,2,3,4,7,4,3,2};
int b[9] = { 0 };
int len = sizeof(a) / sizeof(a[0]);

for (int i = 0; i < len; ++i)
{
b[a[i]] += 1;
}

for (int i = 0; i < 9; ++i)
{
for (int j = 0; j < b[i]; ++j)
{
printf("%d,", i);
}
}
puts("\b;");

char c;
int b[128] = {0};

while ((c = getchar()) != ‘\n’)
{
b[c] += 1;
}

for (int i = 0; i < 128; ++i)
{
if (0 != b[i])
{
printf("%c:%d\n", i, b[i]);
}
}

return 0;
}

二分查找
int main()
{
int a[] = { 2,4,7,9,13,15,18,21,33,34,54,58,60,77,78 };
int len = sizeof(a) / sizeof(a[0]);
int num;
scanf("%d", &num);
int begin, end, mid;
begin = 0;
end = len - 1;
while (begin<=end)
{
mid = (begin + end) / 2;
if (a[mid] > num)
end = mid - 1;
else if (a[mid] < num)
begin = mid + 1;
else
break;找到了
}
if (begin <= end)
printf("%d是第%d个\n",mun, mid);
else
printf("%d不存在\n",num);
return 0;
}

逆序
int main()
{
int a[] = { 1,3,5,7,9,2,4,6,8,0 }；
int len = sizeof(a) / sizeof(a[0]);

for (int i = 0; i < len/2; ++i)
{
	t = a[i];
	a[i]=a[len - 1 - i];
	a[len - 1 - i] = t;

}
for (int i = 0; i < len; ++i)
{
	printf("%d,", a[i])
}
puts("\b;");
return 0;

}

找极da值

int main()
{
int a[] = { 1,3,5,7,9,2,4,6,8,0 };
int len = sizeof(a) / sizeof(a[0]);
int m = 0;
for (int i = 0; i < len; ++i)
{
if (a[i] > a[m])
{
m = i;
}
}
printf("%max:a[%d}=%d\n", m, a[m]);
return 0;
}

找cida值

int main()
{
int a[] = { 1,3,5,7,9,2,4,6,8,0 };
int len = sizeof(a) / sizeof(a[0]);
int m1 = a[0]>a[1]?
int m2 = 0;
for (int i = 0; i < len; ++i)
{
if (a[i] > a[m1])
{
m2 = m1;
m1 = i;
}
}
else if (a[i] > m2)
{
m2 = i;
}
else
{
}
printf("%max:a[%d}=%d\n", m, a[m]);
return 0;
}

转置
#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3; i++)
{
for (j = 0; j < i; j++)
{
t = a[j][i];
a[j][i] = a[i][j];
a[i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}

1 4 7
2 5 8
3 6 9
垂直镜面（
#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3/2; i++)
{
for (j = 0; j<3; j++)
{
t = a[i][j];
a[i][j] = a[3-1-i][j];
a[3-1-i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}
7 8 9
4 5 6
1 2 3
水平镜面
#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3; i++)
{
for (j = 0; j<3/2; j++)
{
t = a[i][j];
a[i][j] = a[i][3 - 1 - j];
a[i][3 - 1 - j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}
3 2 1
6 5 4
9 8 7

#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3; i++)
{
for (j = 0; j < i; j++)
{
t = a[j][i];
a[j][i] = a[i][j];
a[i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3 / 2; j++)
{
t = a[i][j];
a[i][j] = a[i][3 - 1 - j];
a[i][3 - 1 - j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}

7 4 1
8 5 2
9 6 3

#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3; i++)
{
for (j = 0; j < i; j++)
{
t = a[j][i];
a[j][i] = a[i][j];
a[i][j] = t;
}
}
for (i = 0; i < 3/2; i++)
{
for (j = 0; j < 3; j++)
{
t = a[i][j];
a[i][j] = a[3 - 1 - i][j];
a[3 - 1 - i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}
3 6 9
2 5 8
1 4 7
#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3; i++)
{
for (j = 0; j < i; j++)
{
t = a[j][i];
a[j][i] = a[i][j];
a[i][j] = t;
}
}
for (i = 0; i < 3/2; i++)
{
for (j = 0; j < 3; j++)
{
t = a[i][j];
a[i][j] = a[3 - 1 - i][j];
a[3 - 1 - i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j<3/2; j++)
{
t = a[i][j];
a[i][j] = a[i][3 - 1 - j];
a[i][3 - 1 - j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}
9 6 3
8 5 2
7 4 1
#include<stdio.h>
void main()
{
int a[3][3] = { 1,2,3,4,5,6,7,8,9 }, t, j, i;
for (i = 0; i < 3/2; i++)
{
for (j = 0; j<3; j++)
{
t = a[i][j];
a[i][j] = a[3-1-i][j];
a[3-1-i][j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j<3/2; j++)
{
t = a[i][j];
a[i][j] = a[i][3 - 1 - j];
a[i][3 - 1 - j] = t;
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
}
9 8 7
6 5 4
3 2 1