From 35d4125455e2dc789bab78a32076949dfa9a068d Mon Sep 17 00:00:00 2001
From: vitalii Malcov <vitalikmalkov003@gmail.com>
Date: Tue, 25 Jul 2023 09:44:40 +0200
Subject: [PATCH] =?UTF-8?q?=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=B8=D0=BB=20?=
 =?UTF-8?q?=D0=B4=D0=B7=2025,07,2023?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 NHC/Excercises/дз 25,07,2023.py | 48 +++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 NHC/Excercises/дз 25,07,2023.py

diff --git a/NHC/Excercises/дз 25,07,2023.py b/NHC/Excercises/дз 25,07,2023.py
new file mode 100644
index 0000000..31da53b
--- /dev/null
+++ b/NHC/Excercises/дз 25,07,2023.py	
@@ -0,0 +1,48 @@
+def verifier(message, actual, expected):
+    print('====================')
+    print(message)
+    if actual != expected:
+        print(actual)
+        print(expected)
+        print('FAILET')
+        return False
+    else:
+        print("PASSED")
+        print('===================')
+        return True
+
+
+def verify_all(dataset):
+    summa_success = int()
+    summa_failed = int()
+    print("Total:", len(dataset), "Successful:", summa_success, "Failed:", summa_failed)
+    return True
+
+
+def min_array(array):
+    n = array[0]
+    for i in array:
+        if i < n:
+            n = i
+    return n
+
+
+def max_array(array):
+    x = array[0]
+    for i in array:
+        if i > x:
+            x = i
+    return x
+
+
+array = [2, 3, 5, 8, 89, 65, 75, 7895, 2, 1, 1]
+
+
+dataset = [("Test1", 3, min_array(array)), ("Test2", 7895, max_array(array))]
+
+for i in range(len(dataset)):
+    verifier(f"max_array_datatest {i+1}", max_array(dataset[i][0]), dataset[i][1])
+
+for i in range(len(dataset)):
+    verifier(f"min_array_datatest {i+1}", min_array(dataset[i][0]), dataset[i][1])
+