模仿二分查找过程设计一个三分查找算法，分析其时间复杂度

#include<iostream>

using namespace std;

 

int ThSearch(int a[],int low,int high,int k){

         int m1,m2;

         if(low<=high){

                   m1=low+(high-low)/3;

                   m2=low+(high-low)*2/3;

                   if(a[m1]==k)

                            return m1;       

                   if(a[m2]==k)

                            return m2;

                   if(a[m1]>k)

                            return ThSearch(a,low,m1-1,k);