[HELP]:Non-recursive merge sort

[Thuy Linh <thuylinh@bigpond.com>]

Cha`o ca'c ba'c,

Ca'c ba'c computer scientist o+i, ca'c ba'c co' source code cu?a Merge
Sort cho em vo+'i hoa(.c chi? cho em internet sites dde^?  ti`m.

Ma` pha?i la` non-recursive va` in C/C++ , Eiffel or Java nhu+ng ddu+`ng

ddu.ng dde^'n Pascal :-0)

(Em dda~ search tre^n net ma` tha^'y toa`n la` recursive kho^ng, kho^ng
co' bottom-up(non-recursive) method)

Ly' do em ca^`n non-recursive la` no' de^? dde^? convert ra assembly
language ho+n, chu+' co`n recursive thi` o^ng lecturer o^?ng co`n no'i
la` o^?ng co`n kho^ng bie^'t la`m :-)), va` co' la`m ddu+o+.c ddi nu+~a
cu~ng cha.y cha^.m ho+n la` non-recursive method.

Co' ba'c na`o bie^'t chu't ve^` DLX or MIPS dde^? ma` implement ddu+o+.c

le^n tre^n non-recursive merge sort thi` please give em some ideas.

Ca'm o+n ca'c ba'c nhie^`u la('m.
Linh.