CÎÊÌ⣬ÇóÖú

²åÈëÅÅÐòËã·¨£¬×Ô¼ºÓÃCʵÏÖ£¬ÏÂÃæΪ´úÂ룺
#include <stdio.h>
#define size 10
void insertion_sort(int b[],int n);
int main()
{
int n,i;int a[size];
printf("ÇëÊäÈëÊý×éµÄÔªËظöÊý:" );
scanf("%d",&n);
getchar();
printf("ÇëÊäÈë%d¸öÊý:" ,n);
for(i=0;i <n;i++)
scanf("%d",&a[i]);
    insertion_sort(a,n);
printf("ÅÅÐòºóΪ:" );
for(i=0;i <n;i++)
printf("%d ",a[i]);
return 0;
}
void insertion_sort(int b[],int n)
{
int key,i,j,temp;
for(j=1;j <n;j++)
{
key=b[j];
i=j-1;
while(i>0&&b[i]>key)
{
b[i+1]=b[i];
i--;
}
b[i+1]=key;
}
}
µ«ÊÇÓиöÎÊÌ⣬µ±ÊäÈ붼ÊÇÕýÊýʱûÎÊÌ⣬µ«ÊäÈë0»ò¸ºÊýʱ½á¹û²»¶Ô¡£ÄÄÀïÐèÒª¸Äһϣ¿

---

û¿´³öÎÊÌâ¡£¡£¡£Äª·ÇÄãµÄ±àÒëÆ÷intÊÇunsignedÐÍ£¿

---

ÅÅÐòº¯Êý¸ù±¾¾ÍÊÇ´íµÄÂï...
È«ÕýÊýÒ²ÓÐÎÊÌâ

---

#include <iostream>
using namespace std;

void bubblesort(int *a,int n)
{
  for(int i = 0;i <n-1;++1)
  {
      for(int j = i+1;j <n;++j)
      if(a[i]>a[j])
      {
          int temp = a[i];