Update app.py

app.py

@@ -5,22 +5,28 @@
 # Course: CISC-121 (Intro to Computing Science)
 # Description:
 #   Generates a random sorted list and performs binary search
-#   step-by-step, showing each comparison in separate boxes.
+#   step-by-step, showing each comparison and final result.
 # ============================================================
 
 import random
 import gradio as gr
 
+
 # ------------------------------------------------------------
-# Binary Search Function
+# Binary Search Logic (returns list, steps, and final result)
 # ------------------------------------------------------------
 def binary_search_visual(user_number):
     try:
         target = int(user_number)
     except ValueError:
-        return "⚠️ Please enter a valid integer.", *["" for _ in range(8)]
-
-    # Generate a random sorted list of 10 unique numbers between 1–50
+        # Return blanks for all boxes if invalid input
+        return (
+            "⚠️ Please enter a valid integer.",
+            *["" for _ in range(8)],
+            "⚠️ Invalid input.",
+        )
+
+    # Generate a random sorted list of 10 unique numbers (1–50)
     arr = sorted(random.sample(range(1, 50), 10))
 
     steps = []
@@ -43,14 +49,19 @@ def binary_search_visual(user_number):
             high = mid - 1
 
     if not found:
-        steps.append("❌ Not found. Try again!")
+        steps.append("❌ Number not found in the list.")
 
-    # Pad steps so each step textbox is filled consistently
+    # Pad to fill consistent 8 steps
     while len(steps) < 8:
         steps.append("")
 
-    # Return: one string for list, then 8 step strings
-    return f"Random Sorted List:\n{arr}", *steps[:8]
+    # Create a clear summary message for the last box
+    final_message = (
+        f"✅ The number {target} was found!" if found else f"❌ The number {target} was not found."
+    )
+
+    # Return list display, all 8 steps, and final message
+    return f"Random Sorted List:\n{arr}", *steps[:8], final_message
 
 
 # ------------------------------------------------------------
@@ -59,9 +70,9 @@ def binary_search_visual(user_number):
 with gr.Blocks(title="Binary Search Game") as demo:
     gr.Markdown(
         """
-        # 🎯 Binary Search Game (Step-by-Step)  
+        # 🎯 Binary Search Game (Step-by-Step)
         Each time you click **Run**, a new sorted list of 10 random numbers (1–50) will be generated.  
-        Enter a number and see how **Binary Search** checks values step-by-step!
+        Enter a number and watch **Binary Search** in action, step by step!
         """
     )
 
@@ -69,31 +80,34 @@ with gr.Blocks(title="Binary Search Game") as demo:
     user_number = gr.Number(label="Enter a number to search (1–50)", value=1, precision=0)
     run_button = gr.Button("Run Binary Search 🔎")
 
-    # Output: list display
+    # Output: show the generated list
     list_box = gr.Textbox(label="Generated Sorted List", lines=2, interactive=False)
 
-    # Step outputs
+    # Step-by-step outputs
     gr.Markdown("### 🔹 Search Steps:")
     step_boxes = [gr.Textbox(label=f"Step {i+1}", lines=1, interactive=False) for i in range(8)]
 
-    # Link logic
+    # Final result box
+    result_box = gr.Textbox(label="Final Result", lines=1, interactive=False)
+
+    # Button event linking
     run_button.click(
         fn=binary_search_visual,
         inputs=[user_number],
-        outputs=[list_box, *step_boxes]
+        outputs=[list_box, *step_boxes, result_box],
     )
 
     gr.Markdown(
         """
         ---
-        **How it works:**  
-        1. Binary Search divides the sorted list into halves.  
-        2. It compares your number with the middle value.  
-        3. If smaller → searches left half. If larger → searches right half.  
-        4. Repeats until the number is found or range is empty.
+        **How Binary Search Works:**  
+        1. The list must be sorted.  
+        2. Compare your target with the middle element.  
+        3. If smaller → search the left half. If larger → search the right.  
+        4. Repeat until the number is found or the range is empty.  
         """
     )
 
-# Run the app locally or deploy to Hugging Face
+# Run app locally or deploy to Hugging Face
 if __name__ == "__main__":
     demo.launch()