Advertisement
Ronaldoztupang

Latihan UAP S1 2019 (04/12/2019)

Dec 3rd, 2019
137
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 2.56 KB | None | 0 0
  1. /*
  2.     Abang tuh bilang soalnya harus diselesaikan dengan cara sorting manual,
  3.     bukan dengan sorting library otomatis dari java.util.Arrays; . Jadi,
  4.     ada 2 cara mengerjakan no.1
  5. */
  6. //Cara 1, cara yang curang dengan library java.util.Arrays;
  7. import java.io.*;
  8. import java.util.*;
  9. import java.text.*;
  10. import java.math.*;
  11. import java.util.regex.*;
  12.  
  13. public class Solution {
  14.  
  15.     public static void main(String[] args) {
  16.         Scanner in = new Scanner (System.in);
  17.         int x = in.nextInt();
  18.         int [] angka = new int [x];
  19.         for(int i = 0; i < angka.length; i++){
  20.             angka[i] = in.nextInt();
  21.         }
  22.         Arrays.sort(angka);
  23.         for(int i = 0; i < angka.length; i++){
  24.             System.out.print(angka[i]+" ");
  25.         }
  26.  
  27.     }
  28.  
  29. }
  30.  
  31. //Cara 2, cara manual yang diinginkan KaTing
  32. import java.util.*;
  33. import java.lang.*;
  34.  
  35. /*@author Ronaldoztupang*/
  36.  
  37. public class SortingManual {
  38.     public static String atur(int [] angka){
  39.         for(int i = 0; i < angka.length-1; i++){
  40.             if(angka[i] > angka[i+1]){
  41.                 int smp1 = angka[i], smp2 = angka[i+1];
  42.                 angka[i] = smp2;
  43.                 angka[i+1] = smp1;
  44.                 atur(angka);
  45.             }
  46.         }
  47.         String balik = "";
  48.         for(int i = 0; i < angka.length; i++){
  49.             balik = balik + Integer.toString(angka[i])+" ";
  50.         }
  51.         return balik;
  52.     }
  53.  
  54.     public static void main(String[] args) {
  55.         //banyak algoritma sorting yang tersedia di internet
  56.         //disarankan menggunakan bubble sort karena paling mudah dipahami
  57.         Scanner in = new Scanner (System.in);
  58.         int x = in.nextInt();
  59.         int [] angka = new int [x];
  60.         for(int i = 0; i < angka.length; i++){
  61.             angka[i] = in.nextInt();
  62.         }
  63.         System.out.println(atur(angka));
  64.     }
  65.  
  66. }
  67.  
  68. //No.2
  69.  
  70. import java.io.*;
  71. import java.util.*;
  72. import java.text.*;
  73. import java.math.*;
  74. import java.util.regex.*;
  75.  
  76. public class Solution {
  77.  
  78.     public static void main(String[] args) {
  79.         /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
  80.         Scanner in = new Scanner(System.in);
  81.         int n = in.nextInt();
  82.         System.out.println(hitung(n));
  83.     }
  84.     public static int hitung(int n){
  85.         int total = 0;
  86.         String angka = Integer.toString(n);
  87.         String [] pisah = angka.split("");
  88.         for(int i = 0; i < pisah.length; i++){
  89.             total = total + Integer.parseInt(pisah[i]);
  90.         }
  91.         return total;
  92.     }
  93. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement