Bubble sorting stable algorithm
//O(n square) in average and worst case senario //O(n) in best case senario public static Array BubbleSort(int[] arr,int n) { for(int i=0;i<n-1;i++) { for(int j=0;j<n-i-1;j++) { if(arr[j]>arr[j+1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } ...