Basic sorting algorithms-select sorting algorithms

Basic sorting algorithms-select sorting algorithms

/*************************************** * ******************************* Copyright (c) 2015, WK Studios * Filename: * Compiler: GCC, VS, VC6.0 win32 * Author: WK * Time: 2015 4 20 ************************************* * **********************************/# include <stdio. h> void Change_Sort1 (int * a, int len) {for (int I = 0; I <len; I ++) {int min = I; for (int j = I + 1; j <len; j ++) {if (a [j] <a [min]) min = j ;} int temp = a [I]; a [I] = a [m In]; a [min] = temp ;}// void Change_Sort2 (int * a, int len) {for (int I = 0; I <len; I ++) {int min = I; for (int j = I + 1; j <len; j ++) {if (a [j] <a [min]) min = j;} if (min! = I) // here optimization can reduce the number of exchanges and do not exchange with yourself {int temp = a [I]; a [I] = a [min]; a [min] = temp ;}}int main () {int a [] = {,}; Change_Sort1 (a, sizeof () /sizeof (a [0]); // Change_Sort2 (a, sizeof (a)/sizeof (a [0]); for (int I = 0; I <sizeof (a)/sizeof (a [0]); I ++) {printf ("% d", a [I]);} return 0 ;}