bubble-sort

I'm trying to do a bubble sort in x86 assembly (yes it has to be bubble, as I'm not concerned about speed optimization regarding different types of sorts) and for some reason, my code will not swap the necessary values. Here is my code mov eax, list ;store list in eax mov edx,[eax+4*edi-4] ;temp = var1 cmp edx,[eax+edi*4] ;compare JLE SECOND_LOOP ;jump if var1 < var2 mov [eax+4*edi-4],[eax+edi*4] ;var1 = var2 mov [eax+edi*4], edx ;var2 = temp jmp SECOND_LOOP At the last mov instruction where it's supposed to load the temp back into the address, it..doesn't. The EAX register has the starting

I am writing a program in assembly using tasm. My task is to write a program that will use bubble sort to sort entered string alphabetically. Ex. if you enter "hello" it should write "ehllo". I have writened the begging to enter string and to sort it (I think it works okey until the end where it should print out the result, but at the end it just writes my .data once and the finisheds its work) P.S sorry for bad english .model small .stack 100h .data request db 'This program is using bubblesort to get alphabetical order of your enterd string', 0Dh, 0Ah, 'Enter your string:', 0Dh, 0Ah, '$'

I am trying to use bubble-sort in order to sort a linked list. I use curr and trail in order to traverse thru the list. curr is supposed to be one step ahead of trail always. This is my code so far: void linked_list::sort () { int i,j=0; int counter=0; node *curr=head; node *trail=head; node *temp=NULL; while (curr !=NULL) { curr=curr->next; //couting the number of items I have in my list. counter++; //this works fine. } curr=head->next; // reseting the curr value for the 2nd position. for (i=0; i<counter; i++) { while (curr != NULL) { if (trail->data > curr->data) { temp=curr->next; //bubble

Please can you tell me what is wrong to this implementation of bubble sort algorithm in JavaScript? for (var i=1; i<records.length; i++){ for (var j=records.length; j<1; j--){ if (parseInt(records[i-1]) < parseInt(records[i])){ var temp = records[i-1]; records[i-1] = records[i] records[i] = temp; } } } Ignatius Andrew Couple of codes for bubble sort bubblesort should not be used for larger arrays, can be used for smaller ones for its simplicity. Method 1 var a = [33, 103, 3, 726, 200, 984, 198, 764, 9]; function bubbleSort(a) { var swapped; do { swapped = false; for (var i=0; i < a.length-1; i

Do bubble sorts have any real world use? Every time I see one mentioned, it's always either: A sorting algorithm to learn with. An example of a sorting algorithm not to use. Remy Sharp It depends on the way your data is distributed - if you can make some assumptions. One of the best links I've found to understand when to use a bubble sort - or some other sort, is this - an animated view on sorting algorithms: http://www.sorting-algorithms.com/ Bubble sort is (provably) the fastest sort available under a very specific circumstance. It originally became well known primarily because it was one of

I am having a hard time with this problem which requires a sort of customer names, customer ids, and finally amount due. I have the whole program figured, but cannot figure out the last prototype needed to do the sorting. i have a struct called Customers, and i will provide the int main() part also. I just need any help to gt started on the prototype SortData(). struct Customers { string Name; string Id; float OrderAmount; float Tax; float AmountDue; }; const int MAX_CUSTOMERS = 1000; bool MoreCustomers(int); Customers GetCustomerData(); void OutputResults(Customers [], int); void SortData