I think I’d use pointers into the current position into the list, instead of an index that needs to be scaled every time you use it: mov esi, offset list top: mov edi, esi inner: mov eax, [edi] mov edx, [edi+4] cmp eax, edx jle no_swap mov [edi+4], eax mov [edi], edx no_swap: add edi, … Read more
You are correct that the outer loop iterates n times and the inner loop iterates n times as well, but you are double-counting the work. If you count up the total work done by summing the work done across each iteration of the top-level loop you get that the first iteration does n work, the … Read more
You’re missing several things; the most important being linked lists are not arrays, and as such you cannot easily do certain algorithms with both interchangeably. With that please consider the following: List length is determined by reaching the last node, but you don’t need it for this algorithm. There should be no reason to scan … Read more
Couple of codes for bubble sort bubblesort should not be used for larger arrays, can be used for smaller ones for its simplicity. Optimized way, with all Checks const bubble_Sort = (nums) => { if(!Array.isArray(nums)) return -1; // —>if passed argument is not array if(nums.length<2) return nums; // —>if array length is one or less … Read more
You should use C++’s standard sort function, std::sort, declared in the <algorithm> header. When you sort using a custom sorting function, you have to provide a predicate function that says whether the left-hand value is less than the right-hand value. So if you want to sort by name first, then by ID, then by amount … Read more
function bubble_sort($arr) { $size = count($arr)-1; for ($i=0; $i<$size; $i++) { for ($j=0; $j<$size-$i; $j++) { $k = $j+1; if ($arr[$k] < $arr[$j]) { // Swap elements at indices: $j, $k list($arr[$j], $arr[$k]) = array($arr[$k], $arr[$j]); } } } return $arr; } For example: $arr = array(1,3,2,8,5,7,4,0); print(“Before sorting”); print_r($arr); $arr = bubble_sort($arr); print(“After sorting … Read more
Bubble sort is (provably) the fastest sort available under a very specific circumstance. It originally became well known primarily because it was one of the first algorithms (of any kind) that was rigorously analyzed, and the proof was found that it was optimal under its limited circumstance. Consider a file stored on a tape drive, … Read more
No, your algorithm works but your Write operation is misplaced within the outer loop. int[] arr = { 800, 11, 50, 771, 649, 770, 240, 9 }; int temp = 0; for (int write = 0; write < arr.Length; write++) { for (int sort = 0; sort < arr.Length – 1; sort++) { if (arr[sort] … Read more
To explain why your script isn’t working right now, I’ll rename the variable unsorted to sorted. At first, your list isn’t yet sorted. Of course, we set sorted to False. As soon as we start the while loop, we assume that the list is already sorted. The idea is this: as soon as we find … Read more
#include <stdio.h> #include <stdlib.h> #include <time.h> #include <string.h> void bubble_sort(void *base, size_t n, size_t size, int (*cmp)(const void*, const void *)); int cmp_int(const void *a, const void *b){ int x = *(const int *)a; int y = *(const int *)b; return x < y ? -1 : x > y; } int main() { int … Read more