What makes implementing qsort/bsearch/etc "the basics"?
It seems rather arbitrary, and it mostly measures how well you are able to recite from CS books.
The weird thing is that some of the "basics" aren't even particularly basic. Finding cycles in a linked list was an open research problem for a while. One can argue that interviewees need to know about the Tortise and Hare algorithm, but it's crazy to think that someone who hasn't should be able to come up with it on the spot.
They are the stuff you should understand anyway if you build software and are easy enough to figure out in an interview session if you have any analytical skill.
On the other hand, many so-called real world questions measure only how well you are able to recite from API documentation of interviewer's favourite framework or at best the language specification.