请教一下这个算法的时间复杂度

Question

#include "stdio.h"
void outputResult(int* a,int n){
printf("当前情况:");
for(int i=0;i<n;i++){
printf("%d\t",a[i]);
}
printf("\n");
}
int binarySearch(int* a,int x,int left,int right){
int middle;
while (left<=right)
{
middle=(left+right)/2;
if(x==a[middle])
return middle;
if(x>a[middle]){
left=middle+1;
}else{
right=middle-1;
}
}
if(x>a[middle])
return middle;
return middle-1;
}
void shiftRight(int* a,int s,int t,int k){
for(int i=0;i<k;i++){
int temp=a[t];
for(int j=t;j>s;j--){
a[j]=a[j-1];
}
a[s]=temp;
}
}
void mergeArray(int* a,int k,int n){
int i=0;
int j=k;
while (i<j&&j<n)
{
int p=binarySearch(a,a[i],j,n-1);
shiftRight(a,i,p,p-j+1);
i+=p-j+2;
j=p+1;
}
}
int main()
{
int a[9]={0,3,6,9,1,2,4,5,8};
outputResult(a,9);
mergeArray(a,4,9);
outputResult(a,9);
getchar();
return 0;
}