有序数组合并merge

#include <stdio.h>
#include <limits.h>

#define NUMCOUNT 10

int nums[NUMCOUNT];
int snums[NUMCOUNT];

#define THRDCOUNT 2

void merge()
{
    int idx[THRDCOUNT];
    int pernum = (NUMCOUNT/THRDCOUNT);
    for(int i = 0; i < THRDCOUNT; i++)
    {
        idx[i] = i * pernum;
    }

    int miniidx = INT_MAX;
    for(int i = 0; i < NUMCOUNT; i++)
    {
        int min = INT_MAX;
        // get minimum number 
        for(int n = 0; n < THRDCOUNT; n++)
        {
            int index = idx[n];
            if(idx[n] < (n+1)*pernum && nums[index] < min)
            {
                min = nums[index];
                miniidx = n;
            }
        }

        snums[i] = min;
        idx[miniidx] += 1; // count the fetched numbers 
    }
}

int main()
{
	// 子数组1
    nums[0] = 3,
    nums[1] = 5,
    nums[2] = 7,
    nums[3] = 8,
    nums[4] = 10,

	// 子数组2
    nums[5] = 2,
    nums[6] = 6,
    nums[7] = 9,
    nums[8] = 10,
    nums[9] = 11,

	// 合并 子数组1  子数组2
    merge();

    for(int i = 0; i < NUMCOUNT; i++)
    {
        printf("%d,", snums[i]);
    }
    printf("\n");

    return 0;
}