Will I ever have to implement linked lists,stacks, queues, hash tables,sorting algorithms manually in software development? Or is the standard library do all that work? Just wondering because I am trying to learn how to do these things without the respective libraries.
You might get a job developing software infrastructure libraries, in which case you might have to write or maintain trees, tries, adjacency lists, allocators, thread pools, concurrent hashes, multipriority queues, multiindex containers, I/O multiplexors, reactors, whatever the programmers need. And yes, custom sorting algorithms.