can sorting algorithms work on all datastructures? code example
Example 1: 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;
Example 2: sorting in data structure
A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.