Rather, because the underlying datatype is a linked list, merge sort is faster to use than quicksort. 
I myself am looking into how Forths and similar concatenative stack-based languages can be built, because I am in the process of building my own.
Also… I just realized that I’ve been programming in about ten different languages interchangeably during this week. This cannot be healthy… 
