View difference between Paste ID: jCZ1V6vg and YGst2Hmc

 // Author : Saurav Kalsoor
-// Sort By Primes - JAVA
+// Sort By Primes - KOTLIN
 
-import java.util.*;
+import java.util.*
 
-public class Test {
+var sc: Scanner = Scanner(System.`in`)
 
-    static Scanner sc = new Scanner(System.in);
+fun main() {
-    public static void main(String[] args) {
+    val n: Int = sc.nextInt()
-        int n = sc.nextInt();
+    val arr: ArrayList<Int> = ArrayList<Int>()
     for (i in 0 until n) {
-        ArrayList<Integer> arr = new ArrayList<>();
+        val input: Int = sc.nextInt()
         arr.add(input)
-        for(int i=0; i < n; i++) {
+
-            int input = sc.nextInt();
+    val result: ArrayList<Int> = sortPrimeNonPrime(arr, n)
-            arr.add(input);
+    for (i in 0 until n) print(result.get(i).toString() + " ")
     println()
 }
-        ArrayList<Integer> result = sortPrimeNonPrime(arr, n);
+
-
+fun sortPrimeNonPrime(arr: ArrayList<Int>, n: Int): ArrayList<Int> {
-        for(int i=0; i < n; i++)
+    val maxLimit = 10001
-            System.out.print(result.get(i) + " ");
+    val primesSet: HashSet<Int> = HashSet<Int>()
-
+    val isPrime = BooleanArray(maxLimit)
-        System.out.println();
+
     for (i in 2 until maxLimit) isPrime[i] = true
 
-    public static ArrayList<Integer> sortPrimeNonPrime(ArrayList<Integer> arr, int n){
+    for (i in 2 until maxLimit) {
         if (isPrime[i]) {
-        int maxLimit = 10001;
+            primesSet.add(i)
-        HashSet<Integer> primesSet = new HashSet<>();
+            var j: Int = i * i
-        boolean[] isPrime = new boolean[maxLimit];
+            while (j < maxLimit) {
                 isPrime[j] = false
-        for(int i=2; i < maxLimit; i++) isPrime[i] = true;
+                j += i
             }
-        for(int i=2; i < maxLimit; i++){
+
-            if(isPrime[i]){
+
-                primesSet.add(i);
+    val primes: ArrayList<Int> = ArrayList<Int>()
-                for(int j = i*i ; j < maxLimit; j += i)
+    val nonPrimes: ArrayList<Int> = ArrayList<Int>()
-                    isPrime[j] = false;
+    for (i in 0 until n) {
         if (primesSet.contains(arr.get(i))) {
             primes.add(arr.get(i))
         } else {
-        ArrayList<Integer> primes = new ArrayList<Integer>();
+            nonPrimes.add(arr.get(i))
-        ArrayList<Integer> nonPrimes = new ArrayList<Integer>();
+
     }
-        for(int i=0; i < n; i++){
+
-            if(primesSet.contains(arr.get(i))){
+    Collections.sort(primes)
-                primes.add(arr.get(i));
+    Collections.sort(nonPrimes, Collections.reverseOrder())
-            }else{
+
-                nonPrimes.add(arr.get(i));
+    val result: ArrayList<Int> = ArrayList<Int>()
     var j = 0
     var k = 0
 
-        Collections.sort(primes);
+    for (i in 0 until n) {
-        Collections.sort(nonPrimes, Collections.reverseOrder());
+        if (primesSet.contains(arr.get(i))) {
-
+            result.add(primes.get(j))
-        ArrayList<Integer> result = new ArrayList<Integer>();
+            j++
         } else {
-        int j = 0, k = 0;
+            result.add(nonPrimes.get(k))
-        for(int i=0; i < n; i++){
+            k++
-            if(primesSet.contains(arr.get(i))){
+
-                result.add(primes.get(j));
+
-                j++;
+    return result
-            }else{
+}