Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Was ich sortieren muss: Leitern!
- public class Exercise17 {
- }
- class Leiter implements Comparable<Leiter>{
- protected int sprossen;
- Leiter(int s){
- this.sprossen = s;
- }
- public int setSprossen(int h){
- sprossen = h;
- return sprossen;
- }
- public int getSprossen(){
- return sprossen;
- }
- public String toString(){
- return "Die Leiter hat "+sprossen+" Sprossen.";
- }
- public int compareTo(Leiter l){
- int vgl = 0;
- if(this.getSprossen()==l.getSprossen()){vgl = 0;}
- if(this.getSprossen() > l.getSprossen()){vgl = 1;}
- if(this.getSprossen() < l.getSprossen()){vgl = -1;}
- return vgl;
- }
- }
- ...und der BubbleSort...
- public class MySort17 {
- MySort17(){
- public static Comparable findMax(Comparable data[]){
- Comparable mega = data[0];
- for(int i=0; i<data.length; i++){
- if(data[i].compareTo(mega)==1){mega = data[i];}
- }
- return mega;
- }
- public static void swap(int i, int j, Comparable[] data){
- Comparable temp = data[i];
- data[i] = data[j];
- data[j] = temp;
- }
- /**
- * Sortiert einen Array der Größe nach.
- */
- public static void bubbleSort(Comparable[] data){
- for(int k = data.length-1; k>0; k--){
- for(int l = 1; l<= k; l++){
- if(data[l-1].compareTo(data[l]) > 0){swap(l-1, l, data);
- }
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement