简单选择与冒泡排序法

/**********简单选择排序****************/
#include <stdio.h>

#define N 5

int main(int argc, const char *argv[])
{
int i, j, k, temp;
int a
= {0};

printf("plz input %d integer numbers : ", N);
for(i = 0; i < N; i++)
{
scanf("%d", &a[i]);
}

for(i = 0; i < N-1; i++)
{
k = i;
for(j = i+1; j < N; j++)
{
if(a[k] > a[j])
k = j;
}
if(k != i)
{
temp = a[k];
a[k] = a[i];
a[i] = temp;
}
}

printf("The sort result is :");
for(i = 0; i < N; i++)
{
printf("%d ", a[i]);
}

putchar(10);
return 0;
}

/******冒泡法********/
#include <stdio.h>

#define N 7

int main(int argc, const char *argv[])
{
int i, j;
int a
= {0};

printf("plz input %d integer numbers : ", N);
for(i = 0; i < N; i++)
{
scanf("%d", &a[i]);
}

for(i = 1; i < N; i++)
{
for(j = 0; j < N-i; j++)
{
if(a[j] > a[j+1])
{
a[j] ^= a[j+1];
a[j+1] ^= a[j];
a[j] ^= a[j+1];
}
}
}

printf("The bubble sort result is : ");
for(i = 0; i < N; i++)
{
printf("%d ", a[i]);
}

puts("");
return 0;
}