FilesExpand file tree

 master

/

selection_Sort.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (45 loc) · 992 Bytes

 master

/

selection_Sort.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (45 loc) · 992 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

#include<iostream>

using namespace std;

//选择排序

// void selectionSort(int array[], int n){

// for(int i = 0; i<n-1; i++){

// int min = array[i]; int tmp;

// for(int j = i+1; j<n; j++){

// if(array[j]<min){

// tmp = array[j];

// array[j] = min;

// min = tmp;

// }

// }

// array[i] = min;

// }

// }

void selectionSort2(int array[], int n){

int i, j, min, max;

for( i = 0; i<n/2; i++){

int min = max = i;

for( j = i + 1; j<n-i; j++){

if(array[j]<array[min]){

min = j;

}

if(array[j]>array[max]){

max = j;

}

}

int mintmp = array[min];

int maxtmp = array[max];

array[min] = array[i];

array[max] = array[n-i-1];

array[i] = mintmp;

array[n-i-1] = maxtmp;

}

}

int main()

{

int data[]={5,1,19,22,3,1,23,6}; //输入待排序数组

selectionSort2(data,8);

for(int i=0;i<8;i++)

cout<<data[i]<<" ";

cout<<"\n";

return 0;

}