Bubble Sort

 Let's begin!

Bubble Sort is a Sorting Algorithm which has two parts:

1. Bubbles up the largest element at the last.
2. Keep checking if the list is sorted.

One function will keep bringing the biggest elements at the last of the list and another function will recursively calling it until the list is sorted.

	#include <iostream>
	void print(int*arr, int length = 5)
	{
	for(int i = 0; i < length; i++)
	{
	std::cout<<arr[i]<<" ";
	}
	std::cout<<"\n";
	}
	int *bubble(int *arr, int length = 5)
	{
	int i = 0;
	while (i <= length)
	{
	if(arr[i] > arr[i+1])
	{
	int temp = arr[i];
	arr[i] = arr[i+1];
	arr[i+1] = temp;
	}
	i+=1;
	}
	return arr;
	}
	int *bubble_sort(int *arr, int length = 5)
	{
	arr = bubble(arr);
	for(int i=0 ; i<length; i++)
	{
	if(arr[i] > arr[i+1])
	{
	bubble_sort(arr);
	}
	}
	return arr;
	}
	int main()
	{
	int arr[5] = {3,6,50,2,9};
	print(arr);
	print(bubble_sort(arr));
	return 0;
	}

view raw bubble_sort.cpp hosted with ❤ by GitHub

	package Algorithms.Sort;
	import java.util.Scanner;
	public class BubbleSort {
	public static void print(int arr[])
	{
	System.out.print("Sorted Array: ");
	for(int i=0; i<arr.length; i++)
	{
	System.out.print(arr[i]+" ");
	}
	System.out.println("");
	}
	public static boolean isSorted(int arr [])
	{
	for(int i=0; i<arr.length-1; i++)
	{
	if(arr[i] > arr[i+1])
	{
	return false;
	}
	}
	return true;
	}
	public static int bubble_up(int arr []) []
	{
	for(int i=0; i<arr.length-1; i++)
	{
	if(arr[i] > arr[i+1])
	{
	int temp = arr[i];
	arr[i] = arr[i+1];
	arr[i+1] = temp;
	}
	}
	return arr;
	}
	public static int bubbleSort(int arr []) []
	{
	arr = bubble_up(arr);
	if (isSorted(arr) == true)
	{
	return arr;
	}
	return bubbleSort(arr);
	}
	public static void main(String args [])
	{
	Scanner scan = new Scanner(System.in);
	System.out.println("Length of Array: ");
	int length = scan.nextInt();
	int [] arr = new int [length];
	for(int i=0; i<length; i++)
	{
	System.out.println("Enter element "+ (i+1) +" : ");
	arr[i] = scan.nextInt();
	}
	scan.close();
	arr = bubbleSort(arr);
	print(arr);
	}
	}

view raw BubbleSort.java hosted with ❤ by GitHub

	def linear_sort(arr):
	for i in range(len(arr)-1):
	if (arr[i] > arr[i+1]):
	temp = arr[i+1]
	arr[i+1] = arr[i]
	arr[i] = temp
	return arr
	def bubble_sort(arr):
	arr = linear_sort(arr)
	for i in range(len(arr)-1):
	if (arr[i] > arr[i+1]):
	return bubble_sort(arr)
	return arr
	if __name__ == "__main__":
	user_input = input("Enter Length of the List: ")
	length = int(user_input)
	arr = []
	for num in range(length):
	user_input = input("Enter Element {} : ".format(num+1))
	arr.append(int(user_input))
	print("Given List: ",arr)
	bubble_sort(arr)
	print("Sorted List: ",arr)

view raw bubble_sort.py hosted with ❤ by GitHub