<div>
thanks I got some help and I basically have it done!
</div>


thanks I got some help and I basically have it done!

<div>
<div class="content wysiwyg-content">
So I am in an intro to assembly course and this is one of our projects.<br />
<br />
The only part that we have to do is the quick sort. &nbsp;We are provided the C++ driver for our sorting subroutine.<br />
<br />
I am worried about conceptually thinking though quick sort and coming up with a design plan, which is hopefully, where you all come in. &nbsp;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!<br />
<br />
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. &nbsp;Please let me know asap if you need me to go into more detail! &nbsp;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.
</div>
</div>


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.

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

An assembly language (or assembler language) is a low-level programming language for a computer or other programmable device in which there is a very strong (generally one-to-one) correspondence between the language and the architecture's machine code instructions. Each assembly language is specific to a particular computer architecture, in contrast to most high-level programming languages, which are generally portable across multiple architectures, but require interpreting or compiling. Assembly language is converted into executable machine code by a utility program referred to as an assembler; the conversion process is referred to as assembly, or assembling the code.

Assembly

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Algorithms

Programming theory deals with the design, implementation, analysis, characterization, and classification of programming languages and their individual features, along with introductory programming concepts like program structure, variable declaration and conditional and looping constructs. Sub-disciplines include the formal semantics of programming languages, type theory, program analysis and transformation, comparative programming language analysis, metaprogramming, domain-specific languages, compiler construction and run-time systems.