d2jsp
Log InRegister
d2jsp Forums > Off-Topic > Computers & IT > Programming & Development > How Would I Sort An Array Of Objects?
Prev12
Add Reply New Topic New Poll
Member
Posts: 6,457
Joined: Mar 12 2007
Gold: 6,745.00
Nov 6 2013 10:56pm
you call a method in another class by using --- className.methodName(arugments);

This post was edited by thenoose on Nov 6 2013 10:56pm
Member
Posts: 11,637
Joined: Feb 2 2004
Gold: 434.84
Nov 7 2013 11:43am
How are you still this clueless? Do you ever bother to ask professors for help?
Member
Posts: 5,609
Joined: May 29 2010
Gold: 6,102.00
Nov 15 2013 08:26pm
Why don't you implement a mergesort or quicksort? :O
Member
Posts: 2,736
Joined: Nov 28 2009
Gold: 34.00
Nov 15 2013 08:33pm
Quote (crazyivans @ 16 Nov 2013 04:26)
Why don't you implement a mergesort or quicksort?  :O


Nice bump turd
Member
Posts: 5,609
Joined: May 29 2010
Gold: 6,102.00
Nov 15 2013 08:36pm
so hostile.
Member
Posts: 2,736
Joined: Nov 28 2009
Gold: 34.00
Nov 15 2013 08:38pm
Quote (crazyivans @ 16 Nov 2013 04:36)
so hostile.


So banned.
Member
Posts: 1,756
Joined: Feb 9 2011
Gold: 112.63
Dec 2 2013 10:27pm
Use a hashtree
Member
Posts: 23,444
Joined: Jun 30 2009
Gold: 167.53
Jan 30 2014 05:40am
Quote (rockonkenshin @ Nov 7 2013 01:43pm)
How are you still this clueless? Do you ever bother to ask professors for help?


Chill. Coding is hard for some people.
Member
Posts: 2,757
Joined: Nov 26 2007
Gold: 1,214.81
Jan 30 2014 08:22am
Code
public static void sort( Student[] students ) {
boolean doPass = true;
Student temp;
while ( doPass ) {
doPass = false;
for ( int i = 0; i < students.length - 1; i++ ) {
if ( students[i].getOverallPercentage( ) > students[i + 1].getOverallPercentage( ) ) {
temp = students[i + 1];
students[i + 1] = students[i];
students[i] = temp;
doPass = true;
}
}
}
}
Member
Posts: 2,757
Joined: Nov 26 2007
Gold: 1,214.81
Jan 30 2014 10:53am
Quote (labatymo @ Jan 30 2014 10:22am)
Code
public static void sort( Student[] students ) {
    boolean doPass = true;
    Student temp;
    while ( doPass ) {
      doPass = false;
      for ( int i = 0; i < students.length - 1; i++ ) {
        if ( students[i].getOverallPercentage( ) > students[i + 1].getOverallPercentage( ) ) {
          temp = students[i + 1];
          students[i + 1] = students[i];
          students[i] = temp;
          doPass = true;
        }
      }
    }
  }


or

Code
public static void sort( Student[] students ) {
loop: while ( true ) {
for ( int i = 0; i < students.length - 1; i++ ) {
if ( students[i].getOverallPercentage( ) > students[i + 1].getOverallPercentage( ) ) {
Student temp = students[i + 1];
students[i + 1] = students[i];
students[i] = temp;
continue loop;
}
}
break;
}
}
Go Back To Programming & Development Topic List
Prev12
Add Reply New Topic New Poll