Assembly Language Suggestions
0
Hey guys, I just wanted to ask if anybody got suggestions on where I can get help with Assembly Language. I need to write the below Shell Sort Algorithm into Assembly Language
while ( (h*3+1) < length ) {
h = 3 * h + 1;
}
while ( h>0 ) {
for (i = h-1; i < length; i++) {
tmp = lst[i];
j = i;
for ( j=i; (j>=h) && (lst[j-h]>tmp); j = j-h) {
lst[j] = lst[j-h];
}
lst[j] = tmp;
}
h = h / 3;
}
Any tips and suggestions are welcomed and appreciated. Thanks.
while ( (h*3+1) < length ) {
h = 3 * h + 1;
}
while ( h>0 ) {
for (i = h-1; i < length; i++) {
tmp = lst[i];
j = i;
for ( j=i; (j>=h) && (lst[j-h]>tmp); j = j-h) {
lst[j] = lst[j-h];
}
lst[j] = tmp;
}
h = h / 3;
}
Any tips and suggestions are welcomed and appreciated. Thanks.
0
http://www.arl.wustl.edu/~lockwood/class/cs306/books/artofasm/toc.html
judging by your code, you can skip directly to chapter 3 or later.
you can also download the book for the extra chapters.
judging by your code, you can skip directly to chapter 3 or later.
you can also download the book for the extra chapters.
0
Fruid
Lurker of Threads
howsyurday wrote...
Hey guys, I just wanted to ask if anybody got suggestions on where I can get help with Assembly Language. I need to write the below Shell Sort Algorithm into Assembly Languagewhile ( (h*3+1) < length ) {
h = 3 * h + 1;
}
while ( h>0 ) {
for (i = h-1; i < length; i++) {
tmp = lst[i];
j = i;
for ( j=i; (j>=h) && (lst[j-h]>tmp); j = j-h) {
lst[j] = lst[j-h];
}
lst[j] = tmp;
}
h = h / 3;
}
Any tips and suggestions are welcomed and appreciated. Thanks.
Wow, whenever assembly language is involved my instincts tell me to retreat. Good for you that you're actively trying to do it. While I don't have any knowledge of assembly try asking around at stackoverflow. There isn't a tag for assembly, but I'm sure someone there could point you in the right direction.
