/media/sda-magnetic/david/Dok-15-2023-11-27/fernuni-hagen/cs-i-ii/old-cs-2-03/java-new/javapackage1/SortBinary.java

import SortBinarySort.*;
import SortBinaryPrint.*;

public class SortBinary {
    static public void main (String [] args) {
        int i;
        int j;
        int tmp;
        String tmpstr;
        
        
        System.out.println ("Ihre Eingabe: \n");
        
        SortBinaryPrint.Print(args);
        SortBinarySortS.sort(args);
        SortBinaryPrint.Print(args);
        
        /*for (i = 0;  i < args.length;  i++)
            System.out.println (args[i]);
            
        System.out.println ("Ihre Eingabe, sortiert: \n");    
            
        for (i = 0;  i < args.length;  i++) {
            tmp = i;
            for (j = i + 1;  j < args.length;  j++) 
                if (args[j].compareTo (args[tmp]) < 0)
                    tmp = j;
            if (tmp != i) {
                tmpstr = args[tmp];
                args[tmp] = args[i];
                args[i] = tmpstr;
            }
        }

        for (i = 0;  i < args.length;  i++)
            System.out.println (args[i]);*/
        
    }
}