Write in JAVA, JUST CHANGE THE SWAP PART I don't want int i and j in (public static void swap(int[] array, int i, int j)) this part. I want you to do it by writing( public static void swap(int[] array){ Just initialize i and j somewhere else please. How can you do that? public class SelectionSort { public static void main(String[] args) { int[] intarray = {20, 35, -15, 7, 55, 1, -22}; for(int lastUnsorted = intarray.length-1; lastUnsorted > 0; lastUnsorted--){ // if largest is in 0th index // we start from the 1st index // if 1st is greater than it, swap the element int largest=0; for(int i=1; i<=lastUnsorted; i++){ if(intarray[i] > intarray[largest]){ largest = i; } } swap(intarray, largest, lastUnsorted); } for(int i=0; i
Write in JAVA, JUST CHANGE THE SWAP PART
I don't want int i and j in (public static void swap(int[] array, int i, int j)) this part.
I want you to do it by writing( public static void swap(int[] array){
Just initialize i and j somewhere else please. How can you do that?
public class SelectionSort {
public static void main(String[] args) {
int[] intarray = {20, 35, -15, 7, 55, 1, -22};
for(int lastUnsorted = intarray.length-1;
lastUnsorted > 0;
lastUnsorted--){
// if largest is in 0th index
// we start from the 1st index
// if 1st is greater than it, swap the element
int largest=0;
for(int i=1; i<=lastUnsorted; i++){
if(intarray[i] > intarray[largest]){
largest = i;
}
}
swap(intarray, largest, lastUnsorted);
}
for(int i=0; i<intarray.length; i++){
System.out.println(intarray[i]);
}
}
public static void swap(int[] array, int i, int j){
if(i == j){
return;
}
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
