Breaking News: Grepper is joining You.com. Read the official announcement!

Bubble sort

Add Answer

Ill Ibis answered on August 15, 2021 Popularity 10/10 Helpfulness 3/10

answer Bubble sort

related bubbleSort

related bubble sort

related Bubble Sort

related bubble sort algorithm

related bubble sort

Bubble sort

Comment

public class BubbleSortExample {  
    static void bubbleSort(int[] arr) {  
        int n = arr.length;  
        int temp = 0;  
         for(int i=0; i < n; i++){  
                 for(int j=1; j < (n-i); j++){  
                          if(arr[j-1] > arr[j]){  
                                 //swap elements  
                                 temp = arr[j-1];  
                                 arr[j-1] = arr[j];  
                                 arr[j] = temp;  
                         }  
                          
                 }  
         }  
  
    }  
    public static void main(String[] args) {  
                int arr[] ={3,60,35,2,45,320,5};  
                 
                System.out.println("Array Before Bubble Sort");  
                for(int i=0; i < arr.length; i++){  
                        System.out.print(arr[i] + " ");  
                }  
                System.out.println();  
                  
                bubbleSort(arr);//sorting array elements using bubble sort  
                 
                System.out.println("Array After Bubble Sort");  
                for(int i=0; i < arr.length; i++){  
                        System.out.print(arr[i] + " ");  
                }  
   
        }  
}

Popularity 10/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: bubble-sort java

Link to this answer
Share Copy Link

Contributed on Mar 05 2022

Ill Ibis

0 Answers Avg Quality 2/10

Closely Related Answers

bubbleSort

Comment

const bubbleSort = (arr) => {
  let temp = 0;
  for (let i = 0; i < arr.length; i++) {
    for (let j = 1; j < arr.length; j++) {
      if (arr[j - 1] > arr[i]) {
        temp = arr[j - 1];
        arr[j - 1] = arr[i];
        arr[i] = temp;
      }
    }
  }
  return arr;
};

console.log(bubbleSort([10, 9, 8, 7, 6, 5, 4, 3, 2, 1]));

Popularity 10/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Jan 02 2022

YosKa (JoniKK)

0 Answers Avg Quality 2/10

bubble sort

Comment

// C program for implementation of Bubble sort
#include <stdio.h>
  
void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}
  
// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
   int i, j;
   for (i = 0; i < n-1; i++)      
  
       // Last i elements are already in place   
       for (j = 0; j < n-i-1; j++) 
           if (arr[j] > arr[j+1])
              swap(&arr[j], &arr[j+1]);
}
  
/* Function to print an array */
void printArray(int arr[], int size)
{
    int i;
    for (i=0; i < size; i++)
        printf("%d ", arr[i]);
    printf("\n");
}
  
// Driver program to test above functions
int main()
{
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    bubbleSort(arr, n);
    printf("Sorted array: \n");
    printArray(arr, n);
    return 0;
}

Popularity 10/10 Helpfulness 3/10 Language c

Source: www.geeksforgeeks.org

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Feb 18 2022

Healthy Hare

0 Answers Avg Quality 2/10

bubble sort

Comment

def bubble_sort(nums):
    n = len(nums)
    for i in range(n):
        swapped = False
        for j in range(1, n - i):
            if nums[j] < nums[j - 1]:
                nums[j], nums[j - 1] = nums[j - 1], nums[j]
                swapped = True
        if not swapped: break
    return nums
print(bubble_sort([9, 8, 7, 6, 5, 4, 3, 2, 1]))

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Sep 17 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

Bubble Sort

Comment

#Bubble Sort
nums = [9, 4, 5, 1, 3, 7, 6]
for i in range(len(nums)):
    for j in range(1, len(nums)):
        if nums[j] < nums[j - 1]:
            nums[j], nums[j - 1] = nums[j - 1], nums[j]

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Aug 15 2021

Old-fashioned Ostrich

0 Answers Avg Quality 2/10

bubble sort algorithm

Comment

bubbleSort(array)
  for i <- 1 to indexOfLastUnsortedElement-1
    if leftElement > rightElement
      swap leftElement and rightElement
end bubbleSort

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: www.programiz.com

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Aug 19 2023

Mizanur Rahman

0 Answers Avg Quality 2/10

bubble sort

Comment

function bubbleSort(arr) {
// This variable is used to either continue or stop the loop
let continueSorting = true;

// while continueSorting is true
while (continueSorting) {
  // setting continueSorting false. below check to see if swap,
  // if a swap,continue sorting. If no swaps, done sorting,
  // and stop our while loop.
  continueSorting = false;

  // loop through the arr from 0 to next to last
  for (let i = 0; i < arr.length - 1; i++) {
    // check if we need to swap
    if (arr[i] > arr[i + 1]) {
      // swap
      let temp = arr[i];
      arr[i] = arr[i + 1];
      arr[i + 1] = temp;

      // since a swap was made, we want to continue sorting
      continueSorting = true;
    }
  }
}

// After all swaps have been made, then we return our sorted array
return arr;

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: sorting-algorithms.me

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Sep 13 2022

katanton reckless

0 Answers Avg Quality 2/10

bubble sort

Comment

int *BubbleSort(int ar[], int size)
{
    bool sorted = false;
    while (sorted == false)
    {
        sorted = true;
        for (int i = 0; i < size; i++)
        {
            if (ar[i] > ar[i + 1])
            {
                swap(ar[i], ar[i + 1]);
                sorted = false;
            }
        }
    }
    return ar;
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on May 10 2022

Clever Curlew

0 Answers Avg Quality 2/10

bubble sort

Comment

import java.util.Arrays;
public class Bubble{
	public static void main(String[] args){
		int[] arr = {5,4,3,2,1}; // Test case array
		
		for(int i =0;i<arr.length-1;i++){ // Outer Loop
		boolean swap = false;
		  for(int j =1;j<arr.length;j++){ // Inner Loop
			  if(arr[j-1]>arr[j]){ // Swapping
				  int temp = arr[j-1];
				  arr[j-1] = arr[j];
				  arr[j] = temp;
				  swap = true;
			  }
		  }
		  if(!swap){ // If you went through the whole arrray ones and 
             break; // the elements did not swap it means the array is sorted hence stop  
		  }
		}
		
		System.out.print(Arrays.toString(arr));
	}
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Apr 24 2022

Sushant Mishra

0 Answers Avg Quality 2/10

bubble sort

Comment

#include<iostream>
void swap(int &a, int &b)
{
  int temp=a;
  a=b;
  b=temp;
}
void bubblesort(int arr[], int n)
{
  for(int i=0;i<n-1;i++)// why upto n-1?
  {
    for(int j=0;j<n-1;j++)
    {
      if(arr[j]>arr[j+1])
      {
        swap(arr[j],arr[j+1]);
      }
    }
  }
}
int main()
{
  int arr[5]={7, 8, 1, -4, 0};
  bubblesort(arr, 5);
  for(int i=0;i<5;i++)
  {
    std::cout<<arr[i]<<std::endl;
  }
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on May 04 2022

Jitu Biswas

0 Answers Avg Quality 2/10

Bubble sort

Contents

More Related Answers

Bubble sort

Closely Related Answers

bubbleSort

bubble sort

bubble sort

Bubble Sort

bubble sort algorithm

bubble sort

bubble sort

bubble sort

bubble sort

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.