3401 - 考试二 冒泡排序

10 9 8 7 6 5 4
3

8
9
10

Solution C

int main(int argc, const char * argv[]) {
    
    int data[7];
    int M = 0;
    int i = 0;
    int j = 0;
    int swap = 1;
    int k = 1;
    int tmp = 0;
      for (i = 0; i < 7; i++) {
        scanf("%d",&data[i]);
    }
    i = 0;
    scanf("%d",&M);
  
    while (swap) {
        swap = 0;
        for (j = 6 ; j > i; j--) {
            if (data[j - 1]>data[j]) {
                swap = 1;
                tmp = data[j - 1];
                data[j - 1] = data[j];
                data[j] = tmp;
            }
        }
            i++;
          k = 1;
              while(data[k-1]<data[k])
              		k++;
            if(k == M+1)
                break;
        
       }
    for (i = 0; i < 7; i++)
        printf("%d ",data[i]);
}

Solution C++

#include <stdio.h>
#define maxSize 7

void sort(int *arr, int n) {
	int i, j;
	int temp;
	for (i = 0; i < n-1; ++i) {
		for (j = i+1; j <= n-1; j++) {
			if (*(arr+i) > *(arr+j)) {
				temp = *(arr+i);
				*(arr+i) = *(arr+j);
				*(arr+j) = temp;
			}
		}
	}
}

void output(int *arr, int n) {
	int i;
	for (i = 0; i < n; i++) {
		printf("%d\n", *(arr+i));
	}
}

int main() {
	int i, n;
	int arr[maxSize];
	
	for (i = 0; i < maxSize; ++i) {
		scanf("%d", &arr[i]);
	}

	scanf("%d", &n);

	sort(arr, n);

	output(arr, n);

	return 0;
}