70 lines
776 B
Java
70 lines
776 B
Java
|
|
public class Aufgabe2 {
|
|
|
|
public static void main(String[] args) {
|
|
|
|
|
|
}
|
|
|
|
public static int[] radixsort(int[] arr) {
|
|
int lang;
|
|
int länge;
|
|
for (int i = 0; i < arr.length-1;i++) {
|
|
|
|
}
|
|
|
|
for (int i = arr.length-1; i > 0;i--) {
|
|
int ziff = ziffer(i);
|
|
|
|
switch(ziff) {
|
|
case 0:
|
|
|
|
break;
|
|
case 1:
|
|
|
|
break;
|
|
case 2:
|
|
|
|
break;
|
|
case 3:
|
|
|
|
break;
|
|
case 4:
|
|
|
|
break;
|
|
case 5:
|
|
|
|
break;
|
|
case 6:
|
|
|
|
break;
|
|
case 7:
|
|
|
|
break;
|
|
case 8:
|
|
|
|
break;
|
|
case 9:
|
|
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
return arr;
|
|
}
|
|
|
|
public static int ziffer(int zahl) {
|
|
for (int i = 2; i < 9;i++) {
|
|
if(zahl%i == 0)
|
|
return i;
|
|
}
|
|
if((zahl-1)%10 == 0)
|
|
return 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
}
|