Can any one help me??

Question

I need the full code for this question. Can any please give me the solution?
Write a java program which does the following:
1.     Declares 2,  1 -D integer arrays called M and N, with 16 elements each.
2.     Populates M and N using Scanner.
3.     Prints the sum of all the elements in M
4.     Prints the maximum and the minimum values in M
5.     Counts the number of even and the number of odd values in M.
6.     Copies the distinct values in M into another array called P, and then print the values in P.
7.     Prints all the elements in P which are not in N.I have tried doing it a bit but got errors.
import java.util.Scanner;
public class hw4 {
public static void main(String[] args) {
     Scanner kb = new Scanner(System.in);
     int[] M = new int[16];
     int[] N = new int[16];
     System.out.println(" Enter elements of M:");
     for(int i=0; i<16; i++) {
               M[i] = kb.nextInt();
     System.out.println("\n Enter elements of N:");
     for(int j=0; j<16; j++) {     
               N[j] = kb.nextInt();
     for(int k=0; k<16; k++) {
          int sum = M[k] + N[k];
     System.out.println("Sum: " +sum);     
     max(M);     
     System.out.println("Max: " +maximum);          
public static int max(int[] t) {
    int maximum = t[0];
    for (int i=1; i<t.length; i++) {
        if (t[i] > maximum) {
            maximum = t;
return maximum;
}Please help me...continue the program. Thanks!                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

Answer 1

JaVa_MAsTeR wrote:
I need the full code for this question. Can any please give me the solution?One bit of advice, never ask for "full code" as that marks you as possibly being lazy. I'm sure that's not what you intended, but the full code is your responsibililty, not ours. Also, when asking for free advice, it's best not to put stipulations on that advice. It can be thought of by some as being kind of rude.
Anyway, your sum doesn't sum M. What you are doing is adding each element in M array to the same element in the N array, and each time you over-write the previous result in Sum. To add the elements of M together, you need to add each element to the sum variable. Inside of the for loop, something like so:
mySum = mySum + arrayElementor to shorten:mySum += arrayElement[i]Edited by: Encephalopathic on Dec 24, 2007 9:20 AM