usually it depends on what kind of requests are presents in queue.
but in std books like tanenbaum says sstf is provide better throughtput in respect of waiting time than elevator algorithm.(general approach)
bcoz in elevator algorithm if request is come behind the head it service that request only in round trip.(huge wait)
even one question also ask in gate about it.(remember sstf and c-look algorithms are used as default case)
hope its helpful.
https://gateoverflow.in/1463/gate1999-1-10
64.3k questions
77.9k answers
244k comments
80.0k users