The ternary search algorithm divides the search interval into three parts and determines in which part the desired value is located, improving search efficiency