How to do a QuickSort subroutine in Assembly (using MASAM)
Posted on 2008-10-30
So I am in an intro to assembly course and this is one of our projects.
The only part that we have to do is the quick sort. We are provided the C++ driver for our sorting subroutine.
I am worried about conceptually thinking though quick sort and coming up with a design plan, which is hopefully, where you all come in. I was hoping someone could link me to some good sites that explain quick sort/ assembler examples of quick sort (that are heavily commented) so I can step though what they are doing!
If you guys need me to go into more detail on how the program will be accepting information, my subroutine will not be reading in data at all (unsigned bytes, with each line accepting up to 50 unsigned bytes.. just decimal numbers)... it'll already be read in and accessible by the stack register. Please let me know asap if you need me to go into more detail! We are graded on efficiency ... which is why I'm doing quicksort (and was recommended by our teacher) but it doesn't matter how big our program is .. just number of executions.