Code:int Trisearch_dq( int key[], int item,int l, int r) { int u, v, step; if (l<=r) { step=(r-l+1) / 3; u=l+step; v=l+2*step; if (item == key[u]) return u; else if (item == key[v]) return v; else if (item > key[v] ) return Trisearch_dq(key, item,v+1,r); else+ if (item > key[u] ) return Trisearch_dq(key, item,ư1,v-1); else return Trisearch_dq(key, item,l,u-1); } else /*khong thanh cong*/ return 0; }Cho cái code to lên 1 tí để bà con coi cho rõ nào.Code:int Trisearch_dq( int key[], int item,int l, int r) { int u, v, step; if (l<=r) { step=(r-l+1) / 3; u=l+step; v=l+2*step; if (item == key[u]) return u; else if (item == key[v]) return v; else if (item > key[v] ) return Trisearch_dq(key, item,v+1,r); else+ if (item > key[u] ) return Trisearch_dq(key, item,ư1,v-1); else return Trisearch_dq(key, item,l,u-1); } else /*khong thanh cong*/ return 0; }