Какая программа реализует сортировку "методом - Ответ на вопрос по информатике №1252000

Вопрос

• void bsort (int*, int);int main (void) { int A[] = {56, 34, 2, 0, 1, -21, 6, 8, 7}; int i, n; n = sizeof(A)/sizeof(A[0]); printf("Original array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); bsort (A, n); printf("nSorted array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); return 0;}void bsort (int *arr, int size){ int i, j, buf; for (i = 0; i < size - 1; i++ ) { for (j = 0; j < size - 1; j++) { if (arr[j] > arr[j + 1]) { buf = arr[j]; arr[j] = arr[j+1]; arr[j+1] = buf; } } }}
• void swap (int*, int*);void bsort (int*, int);int main (void) { int A[] = {56, 34, 2, 0, 1, -21, 6, 8, 7}; int i, n; n = sizeof(A)/sizeof(A[0]); printf("Original array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); bsort (A, n); printf("nSorted array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); return 0;}void swap(int *pa, int *pb){ int temp; temp = *pa; *pa = *pb; *pb = temp;}void bsort (int *arr, int size){ int i, j; for (i = 0; i < size - 1; i++ ) { for (j = 0; j < size - 1; j++) { if (arr[j] < arr[j + 1]) swap(&arr[j], &arr[j+1]); } }}
• void swap (int*, int*);void bsort (int* , int);int main (void) { int A[] = {56, 34, 2, 0, 1, -21, 6, 8, 7}; int i, n; n = sizeof(A)/sizeof(A[0]); printf("Original array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); bsort (A, n); printf("nSorted array: "); for (i = 0; i < n; i++) printf(" %3d", A[i]); return 0;}void swap(int *pa, int *pb){ int temp; temp = *pa; *pa = *pb; *pb = temp;}void bsort (int *arr, int size){ int i, j, min; for (i=0; i < size - 1; i++) { min = i; for (j = i+1; j < size; j++) { if (arr[j] > arr[min]) { min = j; swap(&arr[i], &arr[min]); } } }}

Ответ