Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Tugas Program Sorting, Study notes of Java Programming

Tugas Programing membuat aplikasi sort

Typology: Study notes

2018/2019

Uploaded on 12/21/2019

syafrur-rizal
syafrur-rizal 🇮🇩

2 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Buble Sort
package sorting2;
import java.util.Random;
import java.util.Scanner;
public class Buble {
static Random random = new Random();
static Scanner in = new Scanner(System.in);
public static void main(String[] args) {
int array[] = new int[10000];
for (int i = 0; i < array.length; i++) {
array[i] = CreateArray();
}
BubleSort(array);
}
public static int CreateArray() {
return (random.nextInt(10000)) ;
}
public static void tampil(int a[]) {
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
System.out.println();
}
public static void BubleSort(int a[]) {
int flag = 0;
int temp = 0;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < 10000; j++) {
if (a[i] <= a[j]){
Swap(a, temp, i, j);
}
}
tampil(a);
}
}
public static void Swap(int a[], int temp, int i, int j) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
NAMA : SYAFRURRIZAL NARIDHO
NIM : 140411100115
KELAS : IF2A
pf3
pf4

Partial preview of the text

Download Tugas Program Sorting and more Study notes Java Programming in PDF only on Docsity!

 Buble Sort

package sorting2; import java.util.Random; import java.util.Scanner; public class Buble { static Random random = new Random(); static Scanner in = new Scanner(System.in); public static void main(String[] args) { int array[] = new int[10000]; for (int i = 0; i < array.length; i++) { array[i] = CreateArray(); } BubleSort(array); } public static int CreateArray() { return (random.nextInt(10000)) ; } public static void tampil(int a[]) { for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(" "); System.out.println(); } public static void BubleSort(int a[]) { int flag = 0; int temp = 0; for (int i = 0; i < a.length; i++) { for (int j = 0; j < 10000; j++) { if (a[i] <= a[j]){ Swap(a, temp, i, j); } } tampil(a); } } public static void Swap(int a[], int temp, int i, int j) { temp = a[i]; a[i] = a[j]; a[j] = temp; } }

NAMA : SYAFRURRIZAL NARIDHO

NIM : 140411100115

KELAS : IF2A

 Hasil Running

 Insertion Sort

package sorting2; import java.util.Random; import java.util.Scanner; public class Insertion {

 Analisa

Lebih efesien memakai insertion sort dibandingkan dengan buble sort, karena buble sort

kurang efesien jika data yang diolah cukup banyak. Hal ini di sebabkan karena setiap data

dibandingkan dengan data yang lain untuk menentukan posisi, walaupun data tersebut sudah

sebagian terurut. Sedangkan jika memakai insertion sort akan lebih efesien karena sederhana

dalam penerapannya. Dan juga jika data sudah sebagian terurut maka insertion sort akan lebih

cepat lagi dalam pengurutan data.