bubble-sort

I have following code for bubble sort but its not sorting at all. if I remove my boolean then its working fine. I understand that since my a[0] is lesser than all other elements therefore no swapping is being performed can anybody help me with this. package com.sample; public class BubleSort { public static void main(String[] args) { int a[] = { 1, 2, 4, 5, 6, 88, 4, 2, 4, 5, 8 }; a = sortBuble(a); for (int i : a) { System.out.println(i); } } private static int[] sortBuble(int[] a) { boolean swapped = true; for (int i = 0; i < a.length && swapped; i++) { swapped = false; System.out.println(

While sorting an array for ex: A[5]={1,4,5,3,2} the output must be 1,2,3,4,5 in ascending order. in using the concept of bubble sorting my output is 0,1,2,3,4 what would be the problem in my code int A[5]={1,5,3,2,4}; for(int i=0;i<5;i++){ for(int j=0;j<5;j++){ if(A[j]>A[j+1]) { int t=A[j]; A[j]=A[j+1]; A[j+1]=t; } } } for(i=0;i<5;i++) cout<<A[i]; You need to limit your inner loop to <4: int A[5]={1,5,3,2,4}; for(int i=0;i<5;i++){ for(int j=0;j<4;j++){ if(A[j]>A[j+1]) { int t=A[j]; A[j]=A[j+1]; A[j+1]=t; } } } for(i=0;i<5;i++) cout<<A[i]; Why not use the STL sort? #include <algorithm> std:

I understand that the big O values for Bubble Sort and Selection Sort are the same, (n)^2, but when I try to run both with an array of size 1000, the Bubble Sort takes 962037 swaps to sort the array, while Selection Sort only takes 988 swaps to sort the array. Why are these different? Because the complexity refers to the number of comparisons, not the number of swaps. Both need O(n^2) comparisons, but selection sort needs only n-1 swaps in the worstcase (O(n)), whereas bubblesort might need up to n*(n-1)/2 swaps (O (n^2)). And even if the complexity would refer to the number of swaps - as the

I'm trying to make an universal bubble sort function. It allow to user to write its own compare and swap function. I implemented a swap and compare function for int type, but when I run the code for next array: {3, 5, 8, 9, 1, 2, 4, 7, 6, 0} , I get: 0 0 84214528 2312 1 2 4 7 6 0. Why this is happening? #include <stdio.h> #include <stdlib.h> #define true 1 #define false 0 int compInt(void *a, void *b) // FUNCTION FOR COMPARE INT { if (*(int*)(a) > *(int*)(b)) { return false; } // IF FIRST INT > SECOND INT (WRONG ORDER) RETURN FALSE return true; // RIGHT ORDER -> RETURN TRUE } I think the

I've recently created a C++ program to find the mean median and mode of an array of values. I realize this would be much better to do within a class. However, my function to generate the mean is not spitting out the right number, although I'm pretty certain the logic is fine. Also, I was able to modify a snipbit from something I found online to create a function that generates the mode, or at least the 1st most occurring values it can find, that I was able to implement. However, I am not 100% sure of how to wrap my head around what is actually happening within the function. A better