//下面看一個匯編的綜合運用：冒泡排序。
#include <iostream>
using namespace std;

#define	array_size 10

int a[array_size]={42, 73, 65, 97, 23, 59, 18, 84, 36, 6};

void main()
{
	int *p;
	p=&a[0];
	p--;

	__asm
	{
		mov esi,p;
		mov ecx,array_size;
_outloop:
		mov edx,ecx;
_inloop:
			mov eax, [ esi+ecx*4 ]; //一個int占4字節
		mov ebx, [ esi+edx*4 ];
		cmp eax, ebx;
		jnb _noxchg; //不交換
		mov [ esi+ecx*4 ], ebx;
		mov [ esi+edx*4 ], eax;
_noxchg:
			dec edx;
		jnz _inloop;
		loop _outloop;
	}

		for (int i=0;i<10;i++)
			cout<<a[i]<<" ";
}