View difference between Paste ID: YGst2Hmc and v31w9RAq

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