From 429b8c923972bac0cad7e285b19bfb8cbe6cfaa3 Mon Sep 17 00:00:00 2001
From: user <moussawiali2002@gmail.com>
Date: Sun, 26 Nov 2023 10:50:10 +0200
Subject: [PATCH] Final change

---
 main.py | 48 ++++++++++++++++++++++--------------------------
 1 file changed, 22 insertions(+), 26 deletions(-)

diff --git a/main.py b/main.py
index b0a9810..252e769 100644
--- a/main.py
+++ b/main.py
@@ -109,42 +109,38 @@ def createNestedTabs(Tabs):
 # Sorting tabs according to titles
 def sortTabs(Tabs):
     if len(Tabs) > 1:
-        if len(Tabs) > 1:
-            mid = len(Tabs) // 2
-            left = Tabs[:mid]
-            right = Tabs[mid:]
+        mid = len(Tabs) // 2
+        left = Tabs[:mid]
+        right = Tabs[mid:]
 
-            sortTabs(left)
-            sortTabs(right)
+        sortTabs(left)
+        sortTabs(right)
 
-            i = j = k = 0
+        i = j = k = 0
 
-            while i < len(left) and j < len(right):
-                if left[i]['Title'] < right[j]['Title']:
-                    Tabs[k] = left[i]
-                    i += 1
-
-                else:
-                    Tabs[k] = right[j]
-                    j += 1
-
-                k += 1
-
-            while i < len(left):
+        while i < len(left) and j < len(right):
+            if left[i]['Title'] < right[j]['Title']:
                 Tabs[k] = left[i]
                 i += 1
-                k += 1
 
-            while j < len(right):
+            else:
                 Tabs[k] = right[j]
                 j += 1
-                k += 1
 
-        print("Tabs sorted successfully")
-    else:
-        print("There should be at least two tabs to sort.")
-    printTitles(Tabs)
+            k += 1
+
+        while i < len(left):
+            Tabs[k] = left[i]
+            i += 1
+            k += 1
 
+        while j < len(right):
+            Tabs[k] = right[j]
+            j += 1
+            k += 1
+
+    else:
+        return
 
 # Sorting nested tabs
 def sortNestedTabs(Tabs):