bubble-sort

Closed . This question needs to be more focused. It is not currently accepting answers. Learn more . Want to improve this question? Update the question so it focuses on one problem only by editing this post . Closed 2 years ago . I'm trying to implement the Bubble sort method into an easy coding problem for Ruby, but I'm having some trouble. I understand the idea is to look at the value of the first element and compare it to the value of the second element and then swap them accordingly, but I can't seem to do it in an actual problem. Would anyone be willing to provide a brief example of how

Have a bubblesort routine similar to this. I need to make it more efficient by stopping the loop when the array is sorted or if the array is already sorted. function sortNumbers(listbox) { var x, y, holder; // The Bubble Sort method. for(x = 0; x < ranarray.length; x++) { for(y = 0; y < (ranarray.length-1); y++) { if(ranarray[y] > ranarray[y+1]) { holder = ranarray[y+1]; ranarray[y+1] = ranarray[y]; ranarray[y] = holder; } } } Before enter the inner loop, create a boolean to check if a swap occured inside the inner loop. When the there is no swap the array is sorted. function sortNumbers

I want to sort an array of structures using the bubble sort algorithm and pointers in C. I have a cars structure: typedef struct{ char model[30]; int hp; int price; }cars; and I allocate memory for 12 items: cars *pointer = (cars*)malloc(12*sizeof(cars)); and read data from file: for (i = 0; i <number ; i++) { fscanf(file, "%s %i %i\n", (pointer+i)->model, &(pointer+i)->hp, &(pointer+i)->price); } I pass pointer ptr to bubbleSort function: bubbleSort(pointer, number); Here is my bubbleSort function: void bubbleSort(cars *x, int size) { int i, j; for (i=0;i<size-1;i++) { int swapped = 0; for (j

I need to do is read in an input file into a linked list. Part of the file is: NameA, 25 NameB, 33 NameC, 23 NameD, 39 And after i need to sort by the number (bubble sort) and write it to another file. Here is what i have: #include <stdio.h> #include <stdlib.h> #include <string.h> struct node{ char name[20]; int number; struct node *next; struct node *prev; }*head; int main(void) { struct node *temp; temp = malloc(sizeof(struct node)); temp->next = NULL; head = temp; FILE *ifp; char fnamer[100] = ""; char line[128]; // printf("\n\nPlease Enter the Full Path of the file: \n"); // scanf("%s",

if an array is given in random order , you have to output the minimum number of swaps required to convert into cyclic sorted array. e.g. array given is 3 5 4 2 1 so the first swap will be 5<-->4 result : 3 4 5 2 1 second swap will be 2<-->1 result : 3 4 5 1 2 (final) output : 2 i am not able to get the logic behind this problem. adding some more : swap only possible between adjacent elements and numbers are between range 1 to N Well, don't know if it is the best algorithm available, but I can think of a O(n^2) solution: First, ignore the possibility of the cyclic array. Let's solve a simpler

Fix positive integers n and k . Let A be an array of length n with A[i] an array of length k where every entry is n-i . For example, with n=5 and k=1 , this is just [ [5] , [4] , [3] , [2] , [1] ] and for n=5 and k=2 , this is [ [5,5] , [4,4] , [3,3] , [2,2] , [1,1] ] The goal is to bubble sort this array of arrays by swapping numbers in adjacent arrays (e.g. swap A[i][j1] with A[i+1][j2] ) until every entry of A[i] is i+1 for every i . The question is: how many swaps are necessary and what's an optimal algorithm ? NOTE: There are many, many better sorting algorithms to use. However, for this