Forums: » Register « |  Free Tools |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |
 User Name: Password: Remember me

New Free Tools on Dev Shed!
We're Excited to announce that Dev Shed now has 70 free tools on the site. To learn more, click here!

 Add This Thread To: Del.icio.us   Digg   Google   Spurl   Blink   Furl   Simpy   Y! MyWeb
 « Previous Thread | Next Thread » Thread Tools Search this Thread Rate Thread Display Modes
 Dev Shed Forums Sponsor:
#1
February 2nd, 2013, 04:43 PM
 Loverboycode
Registered User

Join Date: Feb 2013
Posts: 6
Time spent in forums: 1 h 8 m 6 sec
Reputation Power: 0
Introduction to Programming, 7th ed., Y. Daniel Yiang, Chapter 21_5

I need urgent help with two homeworks (Exercise 21_3 & 21_5 creating a separate test code for this code:

public class Exercise21_5 {
public static void main(String[] args) {
Integer[][] numbers = { {1, 2, 3}, {4, 5, 6}
};
System.out.println(max(numbers));
}

public static<E extends Comparable<E>> E max(E[][] list) {
E max = list[0][0];

for (int i = 1; i < list.length; i++) {
for (int j = 1; j < list[i].length; j++) {
if (max.compareTo(list[i][j]) < 0) {
max = list[i][j];
}
}
}

return max;
}
}

#2
February 3rd, 2013, 07:34 AM
 NormR
Contributing User

Join Date: Aug 2010
Location: SW Missouri
Posts: 3,593
Time spent in forums: 2 Weeks 3 Days 3 h 35 m 23 sec
Reputation Power: 347
Please edit the post and wrap the code in code tags.

#3
February 3rd, 2013, 03:37 PM
 Loverboycode
Registered User

Join Date: Feb 2013
Posts: 6
Time spent in forums: 1 h 8 m 6 sec
Reputation Power: 0
New to this site

Quote:
 Originally Posted by NormR Please edit the post and wrap the code in code tags.

Hi NormR, don't know how to do what you asking Me. However these are both codes:

// First code

public class Exercise21_5 {
public static void main(String[] args) {
Integer[][] numbers = { {1, 2, 3}, {4, 5, 6}
};
System.out.println(max(numbers));
}

public static<E extends Comparable<E>> E max(E[][] list) {
E max = list[0][0];

for (int i = 1; i < list.length; i++) {
for (int j = 1; j < list[i].length; j++) {
if (max.compareTo(list[i][j]) < 0) {
max = list[i][j];
}
}
}

return max;
}
}

//2nd code different from the first one. But each needs separate test code but i don't know how to put the exceptions in either code to run a seperate test for each.

Second:

public class SelectionSort {

public static void main(String[] args){

Integer[] list = {34, 17, 23, 35, 45, 9, 1};
System.out.println("Original Array: ");
printArray(list);

selectionSort(list);
System.out.println("\nSelection sort:");
printArray(list);
Float[] flist = {34.4f, 17.6f, 23.0f};
selectionSort(list);
}

//selection sort
public static <E extends Comparable<E>> void selectionSort(E[] list)
{
for(int i=0; i<list.length -1; i++)
{
int iSmallest = i;

for(int j=i+1; j<list.length; j++)
{
if(list[iSmallest].compareTo((list[j])) > 0 )
{
iSmallest = j;
}
}
E iSwap = list[iSmallest];
list[iSmallest] = list[i];
list[i] = iSwap;

}
}

public static <E> void printArray(E[] list)
{

for(int i=0; i<list.length; i++)
{
System.out.print(list[i] + ", ");
}
}
}

#4
February 3rd, 2013, 03:40 PM
 NormR
Contributing User

Join Date: Aug 2010
Location: SW Missouri
Posts: 3,593
Time spent in forums: 2 Weeks 3 Days 3 h 35 m 23 sec
Reputation Power: 347
Please edit the post and wrap the code in code tags:
[code] << before the code

>>>>> the code here

[/code] <<<< after the code

It should look like:
Code:
`  int x = 3;`

#5
February 3rd, 2013, 03:57 PM
 Loverboycode
Registered User

Join Date: Feb 2013
Posts: 6
Time spent in forums: 1 h 8 m 6 sec
Reputation Power: 0
You mean this? Won't let me edit, no edit option

// First code

[ public class Exercise21_5 {
public static void main(String[] args) {
Integer[][] numbers = { {1, 2, 3}, {4, 5, 6}
};
System.out.println(max(numbers));
}

public static<E extends Comparable<E>> E max(E[][] list) {
E max = list[0][0];

for (int i = 1; i < list.length; i++) {
for (int j = 1; j < list[i].length; j++) {
if (max.compareTo(list[i][j]) < 0) {
max = list[i][j];
}
}
}

return max;
}
}
/]

//2nd code different from the first one. But each needs separate test code but i don't know how to put the exceptions in either code to run a seperate test for each.

Second:

[ public class SelectionSort {

public static void main(String[] args){

Integer[] list = {34, 17, 23, 35, 45, 9, 1};
System.out.println("Original Array: ");
printArray(list);

selectionSort(list);
System.out.println("\nSelection sort:");
printArray(list);
Float[] flist = {34.4f, 17.6f, 23.0f};
selectionSort(list);
}

//selection sort
public static <E extends Comparable<E>> void selectionSort(E[] list)
{
for(int i=0; i<list.length -1; i++)
{
int iSmallest = i;

for(int j=i+1; j<list.length; j++)
{
if(list[iSmallest].compareTo((list[j])) > 0 )
{
iSmallest = j;
}
}
E iSwap = list[iSmallest];
list[iSmallest] = list[i];
list[i] = iSwap;

}
}

public static <E> void printArray(E[] list)
{

for(int i=0; i<list.length; i++)
{
System.out.print(list[i] + ", ");
}
}
} /]

#6
February 3rd, 2013, 04:04 PM
 Loverboycode
Registered User

Join Date: Feb 2013
Posts: 6
Time spent in forums: 1 h 8 m 6 sec
Reputation Power: 0
Now edited, agree?

// First code that was submitted

[ public class Exercise21_5 {
public static void main(String[] args) {
Integer[][] numbers = { {1, 2, 3}, {4, 5, 6}
};
System.out.println(max(numbers));
}

public static<E extends Comparable<E>> E max(E[][] list) {
E max = list[0][0];

for (int i = 1; i < list.length; i++) {
for (int j = 1; j < list[i].length; j++) {
if (max.compareTo(list[i][j]) < 0) {
max = list[i][j];
}
}
}

return max;
}
}
/]

//2nd code different from the first one. But each needs separate test code but i don't know how to put the exceptions in either code to run a seperate test for each.

Second:

[ public class SelectionSort {

public static void main(String[] args){

Integer[] list = {34, 17, 23, 35, 45, 9, 1};
System.out.println("Original Array: ");
printArray(list);

selectionSort(list);
System.out.println("\nSelection sort:");
printArray(list);
Float[] flist = {34.4f, 17.6f, 23.0f};
selectionSort(list);
}

//selection sort
public static <E extends Comparable<E>> void selectionSort(E[] list)
{
for(int i=0; i<list.length -1; i++)
{
int iSmallest = i;

for(int j=i+1; j<list.length; j++)
{
if(list[iSmallest].compareTo((list[j])) > 0 )
{
iSmallest = j;
}
}
E iSwap = list[iSmallest];
list[iSmallest] = list[i];
list[i] = iSwap;

}
}

public static <E> void printArray(E[] list)
{

for(int i=0; i<list.length; i++)
{
System.out.print(list[i] + ", ");
}
}
} /]

 Viewing: Dev Shed Forums > Programming Languages > Java Help > Introduction to Programming, 7th ed., Y. Daniel Yiang, Chapter 21_5

## Developer Shed Advertisers and Affiliates

 Thread Tools Search this Thread Search this Thread: Advanced Search Display Modes Rate This Thread Linear Mode Rate This Thread: 5 : Excellent 4 : Good 3 : Average 2 : Bad 1 : Terrible

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts vB code is On Smilies are On [IMG] code is On HTML code is Off
 View Your Warnings | New Posts | Latest News | Latest Threads | Shoutbox Forum Jump Please select one User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home -------------------- Programming Languages    PHP Development        PHP FAQs and Stickies    Perl Programming        Perl FAQs and Stickies    C Programming        C Programming FAQs and Stickies    Java Help        Java FAQs    Python Programming        Python Programming FAQs    Ruby Programming        Ruby Programming FAQs    Game Development        Game Development FAQs Programming Languages - More    ASP Programming        ASP Programming FAQs    .Net Development        .Net Development FAQs    Visual Basic Programming        Visual Basic Programming FAQs    Software Design        Software Design FAQs    ColdFusion Development        ColdFusion Development FAQs    Delphi Programming        Delphi Programming FAQs    Regex Programming        Regex Programming FAQs    XML Programming        XML Programming FAQs    Other Programming Languages        Other Programming Languages FAQs Web Design    HTML Programming        HTML Programming FAQs    JavaScript Development        JavaScript Development FAQs    CSS Help        CSS Help FAQs    Flash Help        Flash Help FAQs    Photoshop Help        Photoshop Help FAQs    Web Design Help        Web Design Help FAQs    Website Critiques        Website Critiques FAQs    Search Engine Optimization        Search Engine Optimization FAQs Mobile Programming    Mobile Programming        Mobile Programming FAQs    iPhone SDK Development        iPhone SDK Development FAQs    Android Development        Android Development FAQs    BlackBerry Development        BlackBerry Development FAQs Web Site Management    Business Help        Business Help FAQs    Development Software        Development Software FAQs    Scripts        Scripts FAQs Databases    Database Management        Database Management FAQs    DB2 Development        DB2 Development FAQs    MySQL Help        MySQL Help FAQs    PostgreSQL Help        PostgreSQL Help FAQs    Firebird SQL Development        Firebird SQL Development FAQs    MS SQL Development        MS SQL Development FAQs    Oracle Development        Oracle Development FAQs    LDAP Programming        LDAP Programming FAQs System Administration    Mail Server Help        Mail Server Help FAQs    Apache Development        Apache Development FAQs    Security and Cryptography        Security and Cryptography FAQs    Antivirus Protection        Antivirus Protection FAQs    DNS        DNS FAQs    IIS        IIS FAQs    Networking Help        Networking Help FAQs    FTP Help        FTP Help FAQs Operating Systems    BSD Help        BSD Help FAQs    Linux Help        Linux Help FAQs    UNIX Help        UNIX Help FAQs    Windows Help        Windows Help FAQs    Mac Help        Mac Help FAQs Web Hosting    Web Hosting        Web Hosting FAQs    Free Web Hosting        Free Web Hosting FAQs    Web Hosting Requests        Web Hosting Requests FAQs    Web Hosting Offers        Web Hosting Offers FAQs Computer Hardware    Computer Hardware    CPUs        CPUs FAQs    Cooling        Cooling FAQs    Embedded Programming        Embedded Programming FAQs    Motherboards        Motherboards FAQs    Multimedia Hardware        Multimedia Hardware FAQs Other    Dev Shed Lounge        Dev Shed Lounge FAQs    Development Articles        Development Articles FAQs    Beginner Programming        Beginner Programming FAQs    Hire A Programmer        Hire A Programmer FAQs    Project Help Wanted        Project Help Wanted FAQs Latest News Updated Hourly    Technology News    Business News    Science News Forum Information    Forum Rules/Guidelines        Forum Rules/Guidelines FAQs    Forum Announcements        Forum Announcements FAQs    Dev Shed Gaming Center        Go to the Dev Shed Battle Arena        Go to the Dev Shed Arcade Games        Go to the Legend of the Green Dragon    Suggestions & Feedback        Suggestions & Feedback FAQs

 Forums: » Register « |  Free Tools |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |

Powered by: vBulletin Version 3.0.5
Copyright ©2000 - 2013, Jelsoft Enterprises Ltd.

© 2003-2013 by Developer Shed. All rights reserved. DS Cluster - Follow our Sitemap