Update app.py

app.py

@@ -1,12 +1,16 @@
 # ============================================================
-# 🔍 Binary Search Game — Two-Stage (Generate → Search)
+# 🔍 Binary Search Game — Two-Stage with Remaining Range View
 # ============================================================
 # Author: Your Name
 # Course: CISC-121
 # Description:
 #   1) Click "Generate List" to create a random sorted list.
 #   2) Enter a number and click "Run Binary Search".
-#   UI shows the list, step-by-step decisions, and final result.
+#   UI shows:
+#      • the list,
+#      • per-step decision,
+#      • per-step remaining range (selected half),
+#      • final result.
 # ============================================================
 
 import random
@@ -29,56 +33,81 @@ def binary_search_on_state(user_number, arr_state):
     # If user hasn't generated a list yet
     if not arr_state:
         list_msg = "⚠️ Please click 'Generate List' first."
-        # Return list warning, blank steps, and final result message
-        return list_msg, *["" for _ in range(MAX_STEPS)], "⚠️ No list to search."
+        # Return list warning, blank step messages, blank ranges, and final result message
+        return (
+            list_msg,
+            *["" for _ in range(MAX_STEPS)],  # step messages
+            *["" for _ in range(MAX_STEPS)],  # range messages
+            "⚠️ No list to search."
+        )
 
     # Validate input
     try:
         target = int(user_number)
     except (TypeError, ValueError):
-        return f"Random Sorted List:\n{arr_state}", *["" for _ in range(MAX_STEPS)], "⚠️ Enter a valid integer."
+        return (
+            f"Random Sorted List:\n{arr_state}",
+            *["" for _ in range(MAX_STEPS)],
+            *["" for _ in range(MAX_STEPS)],
+            "⚠️ Enter a valid integer."
+        )
 
     arr = arr_state[:]  # copy for safety
     steps = []
+    ranges = []
     low, high = 0, len(arr) - 1
     found = False
 
+    # Record initial range before any check (optional but helpful)
+    ranges.append(f"Initial range [low={low}, high={high}] → {arr[low:high+1]}")
+
     while low <= high:
         mid = (low + high) // 2
-        steps.append(f"Checking middle index {mid} → value {arr[mid]}")
+        steps.append(f"Check middle index {mid} → value {arr[mid]}")
+
         if arr[mid] == target:
             steps.append(f"✅ Found {target} at index {mid}")
             found = True
+            # After finding, remaining range is just the match
+            ranges.append(f"Remaining range [low={mid}, high={mid}] → [{arr[mid]}]")
             break
         elif arr[mid] < target:
-            steps.append(f"{arr[mid]} is smaller → searching right half")
             low = mid + 1
+            ranges.append(f"Move right → new range [low={low}, high={high}] → {arr[low:high+1] if low <= high else []}")
         else:
-            steps.append(f"{arr[mid]} is larger → searching left half")
             high = mid - 1
+            ranges.append(f"Move left → new range [low={low}, high={high}] → {arr[low:high+1] if low <= high else []}")
 
     if not found:
         steps.append(f"❌ The number {target} was not found.")
 
-    # Pad steps to fill UI boxes consistently
+    # Pad to fill consistent UI boxes
     while len(steps) < MAX_STEPS:
         steps.append("")
+    while len(ranges) < MAX_STEPS:
+        ranges.append("")
 
     final_msg = f"✅ The number {target} was found!" if found else f"❌ The number {target} was not found."
     list_display = f"Random Sorted List:\n{arr}"
 
-    return list_display, *steps[:MAX_STEPS], final_msg
+    # Return:
+    #   1 list box,
+    #   MAX_STEPS step messages,
+    #   MAX_STEPS range messages,
+    #   1 final result box
+    return list_display, *steps[:MAX_STEPS], *ranges[:MAX_STEPS], final_msg
 
 
 # -------------------------
 # UI
 # -------------------------
-with gr.Blocks(title="Binary Search Game — Two-Stage") as demo:
+with gr.Blocks(title="Binary Search Game — Two-Stage + Range View") as demo:
     gr.Markdown(
         """
-        # 🎯 Binary Search Game — Two-Stage  
-        **Step 1:** Click **Generate List** to create a random sorted list (10 numbers in 1–49).  
-        **Step 2:** Enter a number and click **Run Binary Search** to see each step and the final result.
+        # 🎯 Binary Search Game — Two-Stage (with Remaining Range)
+        **Step 1:** Click **Generate List** (10 unique numbers in 1–49).  
+        **Step 2:** Enter a number and click **Run Binary Search**.  
+        See each decision and the *remaining range* after every step.
         """
     )
 
@@ -93,10 +122,12 @@ with gr.Blocks(title="Binary Search Game — Two-Stage") as demo:
     # List display
     list_box = gr.Textbox(label="Generated Sorted List", lines=2, interactive=False)
 
-    # Step-by-step outputs
-    gr.Markdown("### 🔹 Search Steps")
+    gr.Markdown("### 🔹 Search Steps (Decision Trace)")
     step_boxes = [gr.Textbox(label=f"Step {i+1}", lines=1, interactive=False) for i in range(MAX_STEPS)]
 
+    gr.Markdown("### 🔸 Remaining Range After Each Step")
+    range_boxes = [gr.Textbox(label=f"Range {i+1}", lines=1, interactive=False) for i in range(MAX_STEPS)]
+
     # Final result
     result_box = gr.Textbox(label="Final Result", lines=1, interactive=False)
 
@@ -110,7 +141,7 @@ with gr.Blocks(title="Binary Search Game — Two-Stage") as demo:
     run_btn.click(
         fn=binary_search_on_state,
         inputs=[user_number, arr_state],
-        outputs=[list_box, *step_boxes, result_box],
+        outputs=[list_box, *step_boxes, *range_boxes, result_box],
     )
 
 if __name__ == "__main__":