// Please finish the missing fill me in java code. public static void main(Strin
ID: 3575185 • Letter: #
Question
// Please finish the missing fill me in java code. public static void main(String[] args) { // TODO Auto-generated method stub int[] intArray = { 3, 5, 9, 4, 10, 33, 12, 19, 4, 16, 23, 30 }; int[] intArray1 = { 1, 2, 4, 5, 5, 6, 7, 8, 9, 100 }; System.out.println(largest(intArray, 0)); System.out.println(sum(intArray, 0)); System.out.println(isSorted(intArray, 0)); System.out.println(isSorted(intArray, 8)); System.out.println(isSorted(intArray1, 0)); } public static int largest(int[] myArray, int index) { // TODO Fill me in return 0; } public static int sum(int[] myArray, int index) { // TODO Fill me in return 0; } public static boolean isSorted(int[] myArray, int index) { // TODO Fill me in return false; } }
Explanation / Answer
import java.util.*;
public class large_sum_sort {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] intArray = { 3, 5, 9, 4, 10, 33, 12, 19, 4, 16, 23, 30 };
int[] intArray1 = { 1, 2, 4, 5, 5, 6, 7, 8, 9, 100 };
System.out.println(largest(intArray, 0));
System.out.println(sum(intArray, 0));
System.out.println(isSorted(intArray, 0));
System.out.println(isSorted(intArray, 8));
System.out.println(isSorted(intArray1, 0));
}
private static boolean isSorted(int[] intArray, int k) {
int temp=0;
int count=0;
int arr[]=new int[intArray.length];
for(int i=0;i<arr.length;i++)
arr[i]=intArray[i];
for(int i=0;i<intArray.length;i++){
for(int j=i+1;j<intArray.length;j++){
if(intArray[i]>intArray[j]){
temp=intArray[i];
intArray[i]=intArray[j];
intArray[j]=temp;
}
}
}
// for(int i=0;i<arr.length;i++)
// System.out.println(arr[i]);
for(int i=0;i<intArray.length;i++){
if(arr[i]==intArray[i])
count++;
}
// System.out.println("count:"+count);
if(count==intArray.length)
return false;
else
return true;
}
private static int sum(int[] intArray, int j) {
// TODO Auto-generated method stub
int sum=0;
for(int i=0;i<intArray.length;i++)
sum+=intArray[i];
return sum;
}
private static int largest(int[] intArray, int j) {
// TODO Auto-generated method stub
int large=intArray[0];
for(int i=0;i<intArray.length;i++){
if(intArray[i]>large){
large=intArray[i];
}
}
return large;
}
}
output:33
168
true
false
false
here intArray1 returns false because it is already in sorted form
and intArray retruns true because it sorts the list which is unordered.