a program a day 22 (ds,selection sort)
2010-10-18 00:00
316 查看
/**
*selection sort
**/
#define keyType int
#include<stdio.h>
int selectSort(keyType array[],int n)
{
keyType tmp;
for(int i = 0;i < n - 1;i++)
{
int min = i;
for(int j = i + 1;j < n;j++)
{
if(array[j] < array[min])
min = j;
}
if(min != i)
{
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
}
}
return 0;
}
int main()
{
keyType arr[10] = {2,5,6,3,7,8,0,9,12,1};
printf("before sorted:\n");
for(int i = 0;i < 10;i++)
printf("%d ",arr[i]);
printf("\n");
selectSort(arr,10);
printf("after sorted:\n");
for(int j = 0;j < 10;j++)
printf("%d ",arr[j]);
printf("\n");
return 0;
}
*selection sort
**/
#define keyType int
#include<stdio.h>
int selectSort(keyType array[],int n)
{
keyType tmp;
for(int i = 0;i < n - 1;i++)
{
int min = i;
for(int j = i + 1;j < n;j++)
{
if(array[j] < array[min])
min = j;
}
if(min != i)
{
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
}
}
return 0;
}
int main()
{
keyType arr[10] = {2,5,6,3,7,8,0,9,12,1};
printf("before sorted:\n");
for(int i = 0;i < 10;i++)
printf("%d ",arr[i]);
printf("\n");
selectSort(arr,10);
printf("after sorted:\n");
for(int j = 0;j < 10;j++)
printf("%d ",arr[j]);
printf("\n");
return 0;
}
相关文章推荐
- a program a day 20(ds,straight insertion sort)
- a program a day 21(ds,bubble sort)
- a program a day 23 (ds,shell's sort)
- a program a day 25(ds,quick sort)
- a program a day 19(ds,binary search)
- a program a day 6
- a program a day 7
- 《从零开始学Swift》学习笔记(Day 22)——闭包那些事儿!
- python day22
- 1.8DS trouble day
- a program a day 13
- 《从零开始学Swift》学习笔记(Day 22)——闭包那些事儿!
- 【推导】【构造】Petrozavodsk Summer Training Camp 2015 Day 2: Xudyh (TooSimple) Contest, Saturday, August 22, 2015 Problem G. Travelling Salesman Problem
- One-day-one-program(4)之链表的实现
- a program a day 14
- C#复习三(Day 22)
- One-day-one-program(5)之冒泡排序
- One-day-one-program(7)之顺序栈的实现
- DAY22
- a program a day 8