sort algorithms java
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if(arr[j]>arr[j+1])
{
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
System.out.print("Iteration "+(i+1)+": ");
printArray(arr);
}
return arr;
// BUBBLE SORTjava sort
javaCopyimport java.util.Arrays;
public class SimpleTesting {
public static void main(String[] args) {
int[] arr = new int[]{12,3,5,21,4,85,6,9,2,1};
for (int i : arr) {
System.out.print(i+" ");
}
Arrays.parallelSort(arr);
System.out.println("\nAfter Sorting...");
for (int i : arr) {
System.out.print(i+" ");
}
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
