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 | int Find_Min(int* arr) { int min = arr[0]; for (int i = 0; i < SIZE; i++) { if (min > arr[i]) min = arr[i]; } return min; } int Second_Min(int* arr) { int min = arr[0]; int secondmin = min; for (int i = 0; i < SIZE; i++) { if (arr[i] < min) { secondmin = min; min = arr[i]; } else if ((min < arr[i] && arr[i] < secondmin) || min == secondmin) { secondmin = arr[i]; } } return secondmin; } int Second_Max(int* arr) { int max = arr[0]; int secondMax = max; for (int i = 0; i < SIZE; i++) { if (max < arr[i]) { secondMax = max; max = arr[i]; } else if (max == secondMax || (max > arr[i] && arr[i] > secondMax)) secondMax = arr[i]; } return secondMax; } | cs |
'알고리즘' 카테고리의 다른 글
| Sequencial Search (0) | 2018.05.26 |
|---|---|
| BinarySearch (0) | 2018.05.26 |
| SelectionSearch (0) | 2018.05.26 |
| InsertSort (0) | 2018.05.26 |
| SelectionSort (0) | 2018.05.26 |