Bubble Sort Resources

1. Programiz
2. GeeksForGeeks
3. Tutorialspoint
4. Tutorialkart
5. Guru99
6. W3Schools (India)
7. Youcademy
8. FreeCodeCamp
9. HackerEarth Visualizer
10. WsCubeTech
11. Wikipedia
12. W3Schools (Global)

🔄 Bubble Sort in Java

Bubble Sort ek simple sorting algorithm hai jo repeatedly adjacent elements ko compare karta hai aur agar woh galat order mein hon to unhein swap karta hai. Yeh process har iteration mein array ke largest unsorted element ko end tak pohcha deta hai — is liye ise "bubble" sort kaha jata hai, jaise bubble surface par aata hai.

---

📌 Java Code Example

import java.util.*;

public class BubbleSort {
    public static int[] bubble_Sort(int[] arr) {
        int n = arr.length;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (arr[j] > arr[j + 1]) {
                    int swap = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = swap;
                }
            }
        }
        return arr;
    }

    public static void main(String[] args) {
        System.out.print("Run This Code ... ");
        int[] stored = bubble_Sort(new int[]{90, 20, 50, 70});
        System.out.print(Arrays.toString(stored));
    }
}

📌 C++ Code Example

#include <iostream>
#include <string>
using namespace std;
class BubbleSort {
public:

void sorting(int arr[], int size ) {
    int n = size;
    for (int i = 0; i<n-1; i++){
        for (int j = 0; j < n-i-1; j++){
            if (arr[j]>arr[j+1]){
                int swap = arr[j];
                arr[j] = arr[j+1];
                arr[j+1]= swap;
            }
        }
     }
 }
};


int main(){
    BubbleSort s;
    int arr[] = {10,2,3,456,63,7};
    int size = sizeof(arr)/sizeof(arr[0]);
    s.sorting(arr,size);
    cout << "Ascending sorted array: ";
     for (int k = 0; k<size ; k++){
         cout << arr[k] << " ";
    }
    cout << endl;
       
}

📌 Lua Code Example

function BubbleSort(arr)
  local n = #arr
  for i = 1, n-1 do
    for j = 1 , n-i do
      if arr[j] > arr[j+1] then
        swap = arr[j]
        arr[j] = arr[j+1]
        arr[j+1] = swap
      end
    end
  end
end


local arr = {2,34,9,1,798,7}
BubbleSort(arr)

for i = 1,#arr do 
  io.write(arr[i].." ")
end

📌 C# Code Example

using System;
namespace HelloWorld
{
	public class Program
	{
		public static void Main(string[] args)
		{
			int[] arr = {34,2,100,5,9,7};
			BubbleSort.Sort(arr);
			print(arr);
			 
			
		}
		public static void print(int[] arr)
		{
		  for (int k = 0; k<arr.Length; k++)
		  {
		    Console.Write(arr[k]+" ");
		  }
		}
	}
	
	public class BubbleSort
	{
	  public static void Sort(int[] arr)
	  {
	    int n = arr.Length;
	    for (int i=0; i < n-1; i++)
	    {
	    for (int j = 0; j<n-i-1 ; j++)
	    {
	      if (arr[j] > arr[j+1])
	      {
	        int swap = arr[j];
	        arr[j] = arr[j+1];
	        arr[j+1] = swap;
	        
	      }
	    }
	    }
	  }
	}
}

📌 Ruby Code Example

class BubbleSort
  def initialize arr
    @arr = arr
  end 
  
  def sort
    n = @arr.length 
    for i in 0...(n-1)
      for j in 0...(n-i-1)
        if @arr[j] > @arr[j+1]
          # swap = @arr[j]
          # @arr[j] = @arr[j+1]
          # @arr[j+1] = swap
          @arr[j],@arr[j+1]=@arr[j+1],@arr[j]
        end
      end
    end
    return @arr
  end
end


arr = [89,2,90,4,1,0]
a = BubbleSort.new arr
# a.sort
print a.sort

📌 Rust Code Example

fn BubbleSort(arr : &mut [i64]){
  let n = arr.len();
  for i in 0..n-1{
    for j in 0..n-i-1{
      if arr[j] > arr[j+1]{
        let mut swap = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = swap;
      }
    }
  }
}


fn main(){
  let mut arr = [23,45,9,1,2,0];
  BubbleSort(&mut arr);
  println!("Sort Array : {:?}",arr);
}

📌 Go Code Example

package main
import ("fmt")

func BubbleSort(arr []int ){
  n := len(arr)
  for i := 0; i<n-1 ; i++{
    for j := 0; j<n-i-1; j++{
      if arr[j]> arr[j+1]{
        arr[j],arr[j+1] = arr[j+1] , arr[j]
      }
    }
  }
}

func main(){
  arr := []int{24,6,0,1,34,69,2}
  BubbleSort(arr)
  fmt.Println(arr)
}

📌 Kotlin Code Example

class BubbleSort {
  var arr = arrayOf<Int>()
  
  fun Sort(){
    val n = arr.size
    for (i in 0 until n-1){
      for (j in 0 until n-i-1){
        if (arr[j] < arr[j+1]){
          val swap = arr[j]
          arr[j] = arr[j+1]
          arr[j+1] = swap
        }
      }
    }
  }
}




fun main(){
  val list1 = BubbleSort()
  
  list1.arr = arrayOf(78,2,35,6,223,0,1)
  list1.Sort()
  println(list1.arr.joinToString(","))
}

📌 PHP Code Example

<?php 

function BubbleSort($arr){
  $n = sizeof($arr);
  for ($i = 0; $i<$n-1; $i++){
    for ($j = 0; $j < $n-$i-1; $j++){
      if ($arr[$j] > $arr[$j+1]){
        $swap = $arr[$j];
        $arr[$j] = $arr[$j+1];
        $arr[$j+1] = $swap;
      }
    }
  }
  return $arr;
  
  echo $n ;
}
$arr = array(78,9,2,19,0,1);
$sortarr = BubbleSort($arr);
// print_r ($arr);
print_r ($sortarr);

?>

📌 Scala Code Example

object Main {
  
  def BubbleSort(arr : Array[Int]){
    val n = arr.length
    for (i <- 0 until n-1){
      for (j <- 0 until n-i-1){
        if (arr(j) > arr(j+1)){
          val swap = arr(j)
          arr(j) = arr(j+1)
          arr(j+1) = swap
        }
      }
    }
  }
  
  
	def main(args: Array[String]): Unit = {
	  var arr = Array(78,9,76,2,1,4)
	  BubbleSort(arr)
	  arr.foreach(println)
	  
	
	}
}

📌 java script Code Example

class BubbleSort{
  constructor(arr){
    this.arr = arr.slice();
  }
  Sort(){
    const n = this.arr.length;
    for (let i = 0; i< n-1 ; i++){
      for (let j = 0; j<n-i-1;j++){
        if (this.arr[j] > this.arr[j+1] ){
          const swap = this.arr[j];
          this.arr[j] = this.arr[j+1];
          this.arr[j+1] = swap;
          
        }
      }
    }
    return this.arr;
  }
}




let arr = [78,3,20,9,1,0,5]
const arr1 = new BubbleSort(arr);
console.log(arr1.Sort())

📌 Dart script Code Example

class BubbleSort {
  List<int> arr;
  
  BubbleSort(this.arr);
  
  List<int> Sort() {
    int n = arr.length;
    for (int i = 0; i<n-1; i++){
      for (int j = 0; j<n-i-1; j++){
        if (arr[j] > arr[j+1]){
          int swap = arr[j];
          arr[j] = arr[j+1];
          arr[j+1] = swap;
        }
      }
    }
    return arr;
    // print("Array Length : $arr");
  }
}





void main() {
  List<int> arr = [78,2,1,9,32,0,4];
  BubbleSort arr1 = BubbleSort(arr);
  print("sorted List : ${arr1.Sort()}");
}