Array Partition I

来源:互联网 发布:java socket 发送超时 编辑:程序博客网 时间:2024/06/05 15:32
 
#include <stdio.h>#include <string.h>void swap(int *a, int *b){int temp;temp = *a;*a = *b;*b = temp;}int arrayPairSum(int* nums, int numsSize) {int i, j, temp;for (i = 0; i < numsSize; i++){for (j = numsSize - 1; j >i; j--){if (nums[j] < nums[j - 1]){swap(&nums[j], &nums[j-1]);}}}temp = 0;for (i = 0; i < numsSize; i+=2){temp += nums[i];}return temp;}void  main() {int input[8] = {1,4,3,2 };printf("%d", arrayPairSum(input, 2));system("pause");}

原创粉丝点击