I'm trying to write a function that receives an array of (signed) long integers or a pointer to the array as a parameter, that will sort the array from lowest-to-highest. Using a bi-directional form of the bubble sort algorithm. This is a "learning assmebly" excercise whose description is: The sort itself must be written entirely in inline assembly. If there is need to include any other functionality then it must be in pure C. You must only write a single block of inline assembly, though it can be in a separate sub-function if you want. You must also try to make this assembly section as small and efficient as possible, and must correctly employ constraints. Your inline assembly code should use no named registers, and you should avoid specifying exact registers in your constraints as well. It is intended for use this in AT&T. Anybody has an idea how I can approach this? Kelvin www.likechapaa.com <http://www.dukapress.com>www.dukapress.org -------------------------------------------------------------------------------------------- We help make your website a success. --------------------------------------------------------------------------------------------