Ternary search helps in such scenarios where the function is first increasing and then decreasing or first decreasing and then increasing

at linear functions the array is increase or decrease we use binary search but at quadratic function it decrease then increase or increase then decrease we use tirnary search u could see the visualization of a function at geogebra for example

You don't binary search. Instead, you use ternary search

you can do binary search not on the initial array (for example $$$arr$$$), but on $$$arr_i - arr_{i+1}$$$. Firstly sign of this function will be negative, then positive, so you can use binary search

use binary search and Sparse Table

Check this out https://cp-algorithms.com/num_methods/ternary_search.html

https://oi-wiki.org/basic/binary/#%E4%B8%89%E5%88%86%E6%B3%95 This may help you.