No. :That's scheduling, not compsci
First in, first out is the official name for the algorithm in the context of scheduling.
Anyways, I have to write lessons for all the sorting algorithms in textbooks. I'm arbitrarily starting with quicksort. Does it "have" to be recursive? I can't find a non-recursive algorithm and I'd rather not write one.