Java solution for JortSort

2 files changed, 30 insertions, 12 deletions

diff --git a/challenge-139/ziameraj16/README.md b/challenge-139/ziameraj16/README.md
index f6c41db25d..fe778e7f88 100644
--- a/challenge-139/ziameraj16/README.md
+++ b/challenge-139/ziameraj16/README.md
@@ -1,23 +1,22 @@
-# Workdays
+# Jort Sort
 ## Java Solution
 
 To compile the code run
 ```java
-javac Workdays.java
+javac JortSort.java
 ```
 To run
 ```java
-java Workdays
+java JortSort
 ```
 ### Example
 ```bash
-~/study/github/perlweeklychallenge-club/challenge-138/ziameraj16/java$ javac Workdays.java
-~/study/github/perlweeklychallenge-club/challenge-138/ziameraj16/java$ java Workdays
-Enter the year
-2021
-Number of workdays: 261
-~/study/github/perlweeklychallenge-club/challenge-138/ziameraj16/java$ java Workdays
-Enter the year
-2020
-Number of workdays: 262
+~/study/github/perlweeklychallenge-club/challenge-139/ziameraj16$ java JortSort
+Enter comma separated list
+1,2,3,4,5,6
+1
+~/study/github/perlweeklychallenge-club/challenge-139/ziameraj16$ java JortSort
+Enter comma separated list
+1,2,3,4,5,7,6
+0
 ```
diff --git a/challenge-139/ziameraj16/java/JortSort.java b/challenge-139/ziameraj16/java/JortSort.java
new file mode 100644
index 0000000000..5866196005
--- /dev/null
+++ b/challenge-139/ziameraj16/java/JortSort.java
@@ -0,0 +1,19 @@
+import java.util.*;
+import java.util.stream.Collectors;
+
+public class JortSort {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter comma separated list");
+        List list = Arrays.stream(scanner.nextLine().split(",")).map(Integer::parseInt).collect(Collectors.toList());
+        System.out.println(isSorted(list));
+    }
+
+    private static int isSorted(List<Integer> list) {
+        List temp = new ArrayList(list);
+        Collections.sort(temp);
+        return temp.equals(list) ? 1 : 0;
+    }
+}
+