Bubble Sort
Time complexity - O(n^2) || Space Complexity - O(1) Bubble sort is an inplace sorting algorithm, that means we do not any extra space while bubble sorting public class Main { public static void main(String[] args) throws Exception { int[] arr={1,4,4,5,6,2,3,90,120,43,0}; System.out.println("UnSorted Array :"); for(int i=0;i<arr.length;i++){ System.out.print(arr[i]+" "); } System.out.println(); // bubble sort for(int i=0;i<arr.length-1;i++){ // iterates through first to last cell for(int j=0;j<arr.length-1-i;j++){ // inner loop controls swapping and extent to which swapping is to be performed in array ...