Merge pull request #4045 from dms061/master

Perl Weekly Challenge 111 submission

2 files changed, 26 insertions, 0 deletions

diff --git a/challenge-111/dms061/python3/ch-2-example.txt b/challenge-111/dms061/python3/ch-2-example.txt
new file mode 100644
index 0000000000..2ec9193f74
--- /dev/null
+++ b/challenge-111/dms061/python3/ch-2-example.txt
@@ -0,0 +1,2 @@
+Longest presorted word(s) is/are 7 letters long
+Word(s): ['billowy']
diff --git a/challenge-111/dms061/python3/ch-2.py b/challenge-111/dms061/python3/ch-2.py
new file mode 100644
index 0000000000..e38ce33ef8
--- /dev/null
+++ b/challenge-111/dms061/python3/ch-2.py
@@ -0,0 +1,24 @@
+def sorted(arr):
+    for i in range(0, len(arr)-1, 1):
+        if(arr[i] > arr[i+1]):
+            return False
+    return True
+
+if __name__ == "__main__":
+    length = 0
+    words = []
+    with open("../perl/american-english", "r") as f:
+        for word in f.readlines():
+            word = word.lower().strip()
+            #no need to scan for smaller words ;>
+            #I'm not sure that this saves any [noticable] amount of time
+            if(length < len(word) and sorted(word)):
+                if(len(word) > length):
+                    length = len(word)
+                    words = [word]
+                elif(len(word) == length):
+                    words.append(word)
+                #else: we discard
+    print("Longest presorted word(s) is/are", length, "letters long")
+    print("Word(s):", words)
+