LeetCode - 4. Median of Two Sorted Arrays (C)

Problem:

给定两个排序数组nums1和nums2大小m，n分别返回两个排序数组的中位数。

Solution:

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){
	void ShellSort(int *elem,int size);
	int length=nums1Size+nums2Size;
	int newArrays[length];
	int left=0,right=0;
	double median=0.0;
	for(int i=0;i<nums1Size;i++) newArrays[i]=nums1[i];
	for(int i=nums1Size,j=0;i<length&&j<nums2Size;i++,j++) newArrays[i]=nums2[j];
	ShellSort(newArrays,length);
	left=length/2;
	if(length%2==0){
		left=left-1;
		right=left+1;
	}
	//median=1.0*(newArrays[left]+newArrays[right])/2;
	return right!=0 ? (double)(1.0*(newArrays[left]+newArrays[right])/2) : (double)1.0*newArrays[left];
}
void ShellSort(int *elem,int size){		//O(n^1.3)
	int i,j;
	int temp=0,increment=0;
	for(increment=size/2;increment>0;increment/=2){		//increase. 
		for(i=increment;i<size;i++){
			temp=elem[i];
			for(j=i-increment;j>=0&&temp<elem[j];j-=increment){
				elem[j+increment]=elem[j];
			}
			elem[j+increment]=temp;
		}
	}
}