- Added guest contributions to week 139.

1 files changed, 44 insertions, 0 deletions

diff --git a/challenge-139/mohammad-anwar/java/theweeklychallenge/JortSort.java b/challenge-139/mohammad-anwar/java/theweeklychallenge/JortSort.java
new file mode 100644
index 0000000000..edd5cdf982
--- /dev/null
+++ b/challenge-139/mohammad-anwar/java/theweeklychallenge/JortSort.java
@@ -0,0 +1,44 @@
+package theweeklychallenge;
+
+/*
+
+Week 139:
+
+    https://theweeklychallenge.org/blog/perl-weekly-challenge-139
+
+Task #1: JortSort
+
+    You are given a list of numbers.
+
+    Write a script to implement JortSort. It should return true/false depending if the given list of numbers are already sorted.
+
+*/
+
+import java.util.Arrays;
+import junit.framework.TestCase;
+import static junit.framework.Assert.*;
+
+public class JortSort extends TestCase {
+
+    public static void main(String[] args) {
+        junit.textui.TestRunner.run(theweeklychallenge.JortSort.class);
+    }
+
+    public void testJortSort() {
+        assertEquals(jortSort(new int[] {1,2,3,4,5}), 1);
+        assertEquals(jortSort(new int[] {1,3,4,2,5}), 0);
+    }
+
+    public static int jortSort(int[] n) {
+        int[] s = n.clone();
+        Arrays.sort(s);
+
+        for(int i = 0; i < n.length; i++) {
+            if (n[i] != s[i]) {
+                return 0;
+            }
+        }
+
+        return 1;
+    }
+}