You need to pass by reference; by making a copy, you sort a temporary copy, and then that’s it; it disappears and the original is still unsorted, because, once again, you sorted only a temporary copy of the entire vector. So change vector<int> a to vector<int>& a. Here’s the code, fixed: http://coliru.stacked-crooked.com/a/2f118555f585ccd5
For the 1st error you forgot to type a comma between the register and the immediate. For the 2nd and 3rd errors the CH and CL registers cannot be used for addressing memory. Use SI, DI, or BX instead. Since your array is defined as words you must treat it as such!Change into something like … Read more
The problem, as expected, comes in method sort(): A minor problem is just do always execute the bubble sort n*n times. It is actually better check whether there was a change between any pair in the list. If it was, then there is the need to run again all over the list; if not, there … Read more
I want to know what will be the best case for a bubble sort ? There may be a case wherein there may be no swapping for the say last 2 passes for example. I’m doing my program in C language. Suppose i have an array of 5 elements and i give the elements as … Read more