menghitung running time kode serang

menghitung running time kode serang

nama; moch. saiful rizal
nim;2012420010
kelas A
 
 
 
 
public class UTS2 {
    
*/
    public static void main(String[] args) {
       
String []aa ={"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o",               "p","q","r","s","t","u","v","w","x","y","z"," "};
String [] sd={"10","20","30","40","50","60","70","80","90","00","11","21","31", "41","51","61","71","81","91","01","12","22","32","42","52","62","72"};
String kode = JOptionPane.showInputDialog(null, "Masukkan sandi anda");
char [] c = kode.toCharArray();
for (int i = 0; i < c.length; i++) {
  for (int j = 0; j < aa.length; j++) {
 if(String.valueOf(c[i]).equalsIgnoreCase(aa[j]))
//equals
          System.out.print(sd[j]);
           }
       }
        System.out.println("");
    }
}
RUNNING TIME
  1. String [] aa // sesuai dg jumla array                                                                             27 x
  2. String [] sd // sesuai dg jumla array                                                                             27 x
  3. String kode = JOptionPane.showInputDialog(null, "Masukkan sandi anda");          n x
  4. int i = 0;                                                                                                                       1 x
  5. i < c.length;                                                                                                                 n x
  6. i++                                                                                                                               n x
  7. int j = 0;                                                                                                                       1 x
  8. j < aa.length;                                                                                                               n x n
  9. j++                                                                                                                               n x n
  10. if(String.valueOf(c[i]).equalsIgnoreCase(aa[j]))                                                         n x n +                 56  + 3n + 3n2 kali = T(n) = O ( n3 )



share this article to: Facebook Twitter Google+ Linkedin Technorati Digg
Posted by Dewi Wahyuni, Published at 11.12 and have 0 komentar

Tidak ada komentar:

Posting Komentar