由小到大排序:
include <stdio.h>
int main() {
int number[10] = {9,2,3,1,5,4,8,7,10,6};
int i = 0, j = 0;
int temp = 0;
for( i = 0; i < 10; i++) {
for( j = i; j < 10; j++) {
if( number[j] < number[i] ) {
temp = number[j];
number[j] = number[i];
number[i] = temp;
}
}
}
for( i = 0; i < 10; i++ ) {
printf("%d ", number[i]);
}
return 0;
}
由大到小排序:
#include <stdio.h>
int main() {
int number[10] = {9,2,3,1,5,4,8,7,10,6};
int i = 0, j = 0;
int temp = 0;
for( i = 0; i < 10; i++) {
for( j = i; j < 10; j++) {
if( number[j] > number[i] ) {
temp = number[j];
number[j] = number[i];
number[i] = temp;
}
}
}
for( i = 0; i < 10; i++ ) {
printf("%d ", number[i]);
}
return 0;
}
Perl (1)
這不是氣泡排序吧
樓上說的沒錯 這是selection sort
浪費我時間...
#include
#include
unsigned char sort[999999] = { 0 };
unsigned char length = 0;
void
main(void)
{
printf("請輸入長度 :");
scanf_s("%d", &length);
for (int i = 0; i < length; i++)
{
printf("input number :");
scanf_s("%d", &sort[i]);
}
for (int i = 0; i < length; i++)
{
for (int j = 0; j < length-1; j++)
{
if (sort[j]>sort[j + 1])
{
sort[length + 1] = sort[j];
sort[j] = sort[j + 1];
sort[j + 1] = sort[length + 1];
}
}
}
for (int i = 0; i < length; i++)
printf("%d ",sort[i]);
system("pause");
}
寫反了八 ，上面是"大到小"，下面是"小到大"