Respuesta :
Answer:
Here is the output.
Explanation:
import java.util.Arrays;
public class Main{
public static void main(String[] args){
int[] array={43,42,23,42,4,56,36,7,8,676,54};
System.out.println(Arrays.toString(array));
printArray(array,"*");
System.out.println(""+getFirst(array));
System.out.println(""+getLast(array));
System.out.println(Arrays.toString(getAllButFirst(array)));
System.out.println(""+getIndexOfMin(array));
System.out.println(""+getIndexOfMax(array));
System.out.println(Arrays.toString(swapByIndex(array, 1,2)));
System.out.println(Arrays.toString(removeAtIndex(array,3)));
System.out.println(Arrays.toString(insertAtIndex(array,3,65)));
}
//---1----
public static void printArray(int[] arr, String sep){
for(int i=0; i<arr.length-1;i++){
System.out.print(" "+arr[i]+" "+sep);
}
System.out.println(" "+arr[arr.length-1]);
}
//---2----
public static int getFirst(int[] arr){
return arr[0];
}
//---3----
public static int getLast(int[] arr){
return arr[arr.length-1];
}
//---4-----
public static int[] getAllButFirst(int[] arr){
int[] anotherArray=new int[arr.length-1];
for(int i=1; i<arr.length;i++){
anotherArray[i-1]=arr[i];
}
return anotherArray;
}
//---5------
public static int getIndexOfMin(int[] arr){
int index=0;
int min=arr[0];
for(int i=1; i<arr.length;i++){
if(min>arr[i]){
min=arr[i];
index=i;
}
}
return index;
}
//---6------
public static int getIndexOfMax(int[] arr){
int index=0;
int max=arr[0];
for(int i=1; i<arr.length;i++){
if(max<arr[i]){
max=arr[i];
index=i;
}
}
return index;
}
//---7------
public static int[] swapByIndex(int[] arr, int a , int b){
int temp=arr[a];
arr[a]=arr[b];
arr[b]=temp;
return arr;
}
//---8------
public static int[] removeAtIndex(int[] arr, int index){
int[] anotherArray = new int[arr.length - 1];
for (int i = 0, k = 0; i < arr.length; i++) {
if (i == index) {
continue;
}
anotherArray[k++] = arr[i];
}
// return the resultant array
return anotherArray;
}
//---9------
public static int[] insertAtIndex(int[] arr, int index, int element){
int[] anotherArray = new int[arr.length + 1];
for (int i = 0, k=0;k < arr.length+1; k++) {
if (k == index) {
anotherArray[k]=element;
continue;
}
anotherArray[k] = arr[i++];
}
// return the resultant array
return anotherArray;
}
//---10------
public static boolean isSorted(int[] arr){
for(int i=0; i<arr.length-1;i++){
if (arr[i+1]<arr[i]){
return false;
}
}
return true;
}
}
