Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.InputStreamReader;
- import java.io.IOException;
- public class SortByNonPrimeFactors {
- public static void main(String args[]) throws IOException {
- BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
- int N = Integer.parseInt(reader.readLine());
- Number[] numbers = new Number[N];
- for (int i = 0; i < N; i++) {
- numbers[i] = new Number(Integer.parseInt(reader.readLine()));
- }
- bubbleSort(numbers);
- printHasilSorting(numbers);
- }
- static private void printHasilSorting(Number[] arr) {
- int n = arr.length;
- for (int i = 0; i < n; i++) {
- if (i != 0)
- System.out.print(' ');
- System.out.print(arr[i].num);
- }
- System.out.println();
- }
- static private void bubbleSort(Number[] arr) {
- int N = arr.length;
- Number temp;
- for(int i=0; i < N; i++) {
- for(int j=1; j < (N-i); j++){
- // @TODO: Implementasikan bubble sort Anda disini
- }
- }
- }
- }
- class Number implements Comparable<Number> {
- // @TODO: lengkapi class dengan instance variable, constructor, dan method yang sesuai dan menurut anda diperlukan
- int num;
- public Number(int num) {
- this.num = num;
- }
- int findNonPrimeFactors() {
- // @TODO: lengkapi method ini untuk mencari faktor non prima dari sebuah bilangan
- }
- @Override
- public int compareTo(Number other) {
- // @TODO: lengkapi method untuk sorting sesuai dengan spesifikasi soal
- }
- }
Add Comment
Please, Sign In to add comment