July 24, 2008 01:18pm pdt

1. CEHJ 941,440
2. objects 483,831
3. cmalakar 234,394
4. ksivananth 167,587
5. sciuriware 147,045
6. MicheleM... 116,365
7. Bart_Cr 108,304
8. ysnky 90,336
9. contactka... 88,588
10. krakatoa 87,250
11. Ajay-Singh 58,295
12. dejanpazin 45,050
13. aiklamha 44,350
14. girionis 44,163
15. rrz@87... 40,520

1. objects 9,596,597
2. CEHJ 8,092,343
3. zzynx 1,575,850
4. mayankea... 1,428,588
5. TimYates 1,311,543
6. girionis 1,006,035
7. sciuriware 882,277
8. Ajay-Singh 723,094
9. ksivananth 521,263
10. heyhey_ 515,764
11. aozarov 483,814
12. Javatm 456,951
13. jim_cakalic 420,656
14. orangehe... 393,681
15. hoomanv 378,789

05.08.2008 at 03:34PM PDT, ID: 23387931

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

8.6

implement comparable

Zones: Java Programming Language, Programming Languages

Hello Experts,

I need your assistance how this code can be modified as to implement Comparable and return the largest number in the array

Thanks in advance for any help !

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
54:
55:
56:
57:
58:
59:
60:
61:
62:
63:
64:
65:
66:
67:
68:
69:
70:
71:
72:
73:
74:
75:
76:
77:
78:
79:
80:
81:
82:
83:
84:
85:
86:
87:
88:
89:
90:
91:
92:
93:
94:
95:
96:
97:

           
           
             import java.math.BigDecimal;
import java.util.Arrays;
 
public class MathArray<N extends Number> {
	 
    private Number[] array; 
 
    MathArray(N[] array) {
            this.array = array;
    }
 
 
    void warnNaN( Double bd ) { 
            if(( bd.isNaN() ) )
                    System.err.println("Warning: result is undefined"); 
    } 
 
    void warnNaN( Number bd ) {
            warnNaN( new Double( bd.doubleValue() ) ) ;
    }
 
    void applyNeg() { 
            for(int i = 0; i < array.length; i++) { 
                    array[i] = negate( array[i] ); 
                    warnNaN(array[i]); 
            } 
    } 
 
    private Number negate( BigDecimal bd ){
            return bd.negate() ;
    }
 
    private Number negate( Double bd ){
            return bd.isNaN() ? bd : new BigDecimal( bd.doubleValue() ).negate() ;
    }
 
    private Number negate( Number bd ){
            return negate( new Double( bd.doubleValue() ) ) ; //OVERLOAD THE ABOVE METHOD TO OTHER TYPES
    }
 
 
    void applySqrt() { 
            for(int i = 0; i < array.length; i++) { 
                    array[i] = new Double( Math.sqrt(array[i].doubleValue() ) ); 
                    warnNaN(array[i]); 
            } 
    } 
 
    void applySin() { 
            for(int i = 0; i < array.length; i++) { 
                    array[i] = new Double( Math.sin(array[i].doubleValue()) ); 
                    warnNaN(array[i]); 
            } 
    } 
 
    void applyCos() { 
 
            for(int i = 0; i < array.length; i++) { 
 
                    array[i] = new Double( Math.cos(array[i].doubleValue() ) ); 
 
                    warnNaN(array[i]); 
 
            } 
 
    } 
 
      void print() {
 
            for(int i = 0; i < array.length; i++)
                  System.out.print(array[i] + (i < array.length-1?", ":"\n"));
 
      }
      
      void printLargest(){
            Arrays.sort( array ) ;
            System.out.println( "Largest: " + array[ array.length - 1 ] ) ;  
      }
 
      public static void main(String[] args) {
             
            MathArray<Number> te = new MathArray<Number>( new Number[]{ new BigDecimal( 0.1 ), new BigDecimal( 2.23 ), new BigDecimal( 3.08 ) } );
 
            // apply -Sqrt(Sin(x)) to each element x in the array:
 
            te.printLargest();
            
            te.applySin();
 
            te.applySqrt();
 
            te.applyNeg();
 
            te.print();
 
      }
}

           
         

Start your free trial to view this solution

Question Stats

Zone: Programming

Question Asked By: perdoname_

Solution Provided By: objects

Participating Experts: 2

Solution Grade: B

Translate:

Loading Advertisement...

20080236-EE-VQP-29 / EE_QW_2_20070628