Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.TreeSet;
- public class RicoAkbar {
- public static void tampilkanData(int rico[], int indeksTerakhir){
- for(int i = 0; i <= indeksTerakhir; i++)
- System.out.print(rico[i]+",");
- }
- public static void urutkanBubble(int[] rico, int indeksTerakhir){
- int sementara;
- for(int j = 0; j <= indeksTerakhir - 1; j++)
- {
- for(int i = 0; i <= indeksTerakhir - 1 - j; i++)
- {
- if (rico[i]>rico[i+1])
- {
- sementara = rico[i];
- rico[i] = rico[i+1];
- rico[i+1] = sementara;
- }
- }
- }
- }
- public static void main(String args[]){
- int[] rico = {589, 132, 489, 46, 775};
- int indeksTerakhir = rico.length - 1;
- System.out.println("Data sebelum diurutkan : ");
- tampilkanData(rico, indeksTerakhir);
- urutkanBubble(rico, indeksTerakhir);
- System.out.println("\n\nData setelah diurutkan : ");
- tampilkanData(rico, indeksTerakhir);
- System.out.println();
- int[] rico2 = new int[5];
- rico2 [0]=589;
- rico2 [1]=132;
- rico2 [2]=489;
- rico2 [3]=46;
- rico2 [4]=775;
- System.out.println("Data Awal:");
- for( int i=0; i<rico2.length; i++ ){
- System.out.println( "Data ke "+(i+1)+" adalah "+rico2[i] );
- }
- System.out.println();
- System.out.println("Data Collection");
- TreeSet<String> ts=new TreeSet<String>();
- ts.add("Awit");
- ts.add("Josh");
- ts.add("Josh");
- ts.add("Wahyu");
- ts.add("Josh");
- System.out.println(ts);
- System.out.println("\nDescending: "+ts.descendingSet());
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement