<div>
Well, since you only need to swap (1 register) and remember where you were in the main loop (second register) it should be straight forward. Where are you stuck?
</div>


Well, since you only need to swap (1 register) and remember where you were in the main loop (second register) it should be straight forward. Where are you stuck?

<div>
You may need to use XCHG instead of MOV at least once in your code (assuming this is about x386 assembly)
</div>


You may need to use XCHG instead of MOV at least once in your code (assuming this is about x386 assembly)

<div>
hello TommySzalapski<br />
,<br />
i stuck because i have a confuse how to do the swap. 
</div>


hello TommySzalapski
,
i stuck because i have a confuse how to do the swap.

<div>
<div class="content wysiwyg-content">
i need to implement bubble sort in assemply &nbsp;using only 2 registers.<br />
Is anyone how have information about this concept ? &nbsp;
</div>
</div>


i need to implement bubble sort in assemply  using only 2 registers.
Is anyone how have information about this concept ?  

how can implement buble sort using only 2 registers

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.