?
Solved

How to do a QuickSort subroutine in Assembly (using MASAM)

Posted on 2008-10-30
2
Medium Priority
?
1,241 Views
Last Modified: 2012-08-14
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.
0
Comment
Question by:BusyBeee
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
2 Comments
 
LVL 53

Accepted Solution

by:
Infinity08 earned 1500 total points
ID: 22848388
The wiki gives a nice explanation of quicksort :

        http://en.wikipedia.org/wiki/Quicksort

If you're interested in an assembler listing, you can write the quicksort algorithm in C for example, and let the compiler generate assembler output for it.
0
 

Author Closing Comment

by:BusyBeee
ID: 31511769
thanks I got some help and I basically have it done!
0

Featured Post

Percona Live Europe 2017 | Sep 25 - 27, 2017

The Percona Live Open Source Database Conference Europe 2017 is the premier event for the diverse and active European open source database community, as well as businesses that develop and use open source database software.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

The greatest common divisor (gcd) of two positive integers is their largest common divisor. Let's consider two numbers 12 and 20. The divisors of 12 are 1, 2, 3, 4, 6, 12 The divisors of 20 are 1, 2, 4, 5, 10 20 The highest number among the c…
Introduction This question got me thinking... (http://www.experts-exchange.com/questions/28707487/GLOBALS.html) Why shouldn't we use Globals? This is a simple question without a simple answer.  How do you explain these concepts to a programmer w…
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…
Michael from AdRem Software explains how to view the most utilized and worst performing nodes in your network, by accessing the Top Charts view in NetCrunch network monitor (https://www.adremsoft.com/). Top Charts is a view in which you can set seve…
Suggested Courses

752 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question