面试小问题

#include<iostream>
#include<vector>
#include <stdint.h>

using namespace std;

void sort_t(int *a,int mid,int end)
{
	for(int i = mid;i!= end;i++)
	{
		if(a[i]>a[i+1])
		{
			int tmp = a[i];
			a[i]=a[i+1];
			a[i+1]=tmp;
		}
	}
}


void merge(int *a, int n)
{
	int end = n;
	cout<<end<<endl;
	int mid = end/2;
	for(int i = 0;i!= mid;i++)
	{
		if(a[i]>a[mid])
		{
			int tmp =a[i];
			a[i]=a[mid];
			a[mid]=tmp;
			sort_t(a,mid,end-1);
		}
	}
}



int main()
{
	int a[]={1,3,5,7,9,2,4,6,8,10};
	cout<<sizeof(a)/sizeof(int)<<endl;
	merge(a, sizeof(a)/sizeof(int));
	for(int i = 0;i!=9;i++)
	{
		cout<<a[i];
	}
	getchar();
	getchar();
}

数组前后两部分分别有序，将两部分merge成一个有序数组。