#include <stdio.h>
#include <stdlib.h>
void bubbleSort(int arr[], int n);
int main() {
int n, i;
int sum[100];
printf("请输入要排序的数据个数: ");
scanf("%d", &n);
int *arr = (int *)malloc(n * sizeof(int));
if (arr == NULL) {
printf("内存分配失败\n");
return 1;
}
printf("请输入%d个整数:\n", n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for(i=0;i<100;i++){
if(i<n){
sum[i]=arr[i];
}
else if(i>=n){
sum[i]=arr
}
calculateSum(int arr[], int size)
}
bubbleSort(arr, n);
printf("排序后的数据:\n");
for (i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
free(arr);
printf("Hello world! - c.jsrun.net.");
return 0;
}
void bubbleSort(int arr[], int n) {
int i, j, temp;
for (i = 0; i < n-1; i++) {
for (j = 0; j < n-i-1; j++) {
if (arr[j] > arr[j+1]) {
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
int calculateSum(int arr[], int size) {
int sum = 0;
for (int i = 0; i < size; i++) {
sum += arr[i];
for (int j = 0; j < size; j++) {
}
}
return sum;
}
void cal(int arr[], int n, int threshold){
int min,max,sum;
for((i = n-1; i >=0; i--)
sum=arr[n-1]+arr[n-2];
idx=n-2;
while(1){
if(sum>(threshold-5)){
idx=idx-1;
if(idx>=0);
sum=arr[n-1]+arr[idx-1]
min=arr[n-1];
}
else{
}
if( sum<=(threshold+5) &sum>(threshold-5) ){
break;
}
}
}