Update app.py

app.py

@@ -1,68 +1,78 @@
 # ============================================================
-# 🧠 Binary Search Interactive App
+# 🔍 Binary Search Game (Interactive Gradio App)
 # ============================================================
-# Course: CISC-121 (Intro to Computing Science)
-# Project: Searching & Sorting Algorithms
 # Author: Your Name
+# Course: CISC-121 (Intro to Computing Science)
 # Description:
-#   This Gradio app demonstrates how Binary Search works
-#   step-by-step in an interactive "guess the number" style game.
+#   This app randomly generates a sorted list of numbers and
+#   performs binary search on it based on the user's guess.
+#   It shows each step of the search in the UI.
 # ============================================================
 
-import gradio as gr
 import random
+import gradio as gr
 
-# --------------------------
-# Binary Search Logic
-# --------------------------
-def binary_search_game(target, low=1, high=100):
+# ------------------------------------------------------------
+# Binary Search Function
+# ------------------------------------------------------------
+def binary_search_steps(arr, target):
     steps = []
+    low, high = 0, len(arr) - 1
+
+    steps.append(f"List: {arr}")
+    steps.append(f"Searching for: {target}\n")
+
     while low <= high:
         mid = (low + high) // 2
-        steps.append(f"Checking middle value: {mid}")
-        if mid == target:
-            steps.append(f"✅ Found the number {target}!")
+        steps.append(f"🔹 Checking middle index {mid} (value {arr[mid]})")
+
+        if arr[mid] == target:
+            steps.append(f"✅ Found {target} at position {mid}!")
             return "\n".join(steps)
-        elif mid < target:
-            steps.append(f"{mid} is too low. Searching higher...")
+
+        elif arr[mid] < target:
+            steps.append(f"{arr[mid]} is less than {target} → searching right half")
             low = mid + 1
+
         else:
-            steps.append(f"{mid} is too high. Searching lower...")
+            steps.append(f"{arr[mid]} is greater than {target} → searching left half")
             high = mid - 1
-    steps.append("❌ Number not found (out of range).")
+
+    steps.append("❌ Not found. Try again!")
     return "\n".join(steps)
 
 
-# --------------------------
-# Wrapper for Gradio
-# --------------------------
+# ------------------------------------------------------------
+# Function to handle user interaction
+# ------------------------------------------------------------
 def play_binary_search(user_number):
     try:
         user_number = int(user_number)
-        if not (1 <= user_number <= 100):
-            return "⚠️ Please choose a number between 1 and 100."
     except ValueError:
         return "⚠️ Please enter a valid number."
 
-    result = binary_search_game(user_number)
+    # Generate random sorted list of numbers (unique)
+    arr = sorted(random.sample(range(1, 50), 10))
+
+    result = binary_search_steps(arr, user_number)
     return result
 
 
-# --------------------------
+# ------------------------------------------------------------
 # Gradio Interface
-# --------------------------
-with gr.Blocks(title="Binary Search Simulator") as demo:
+# ------------------------------------------------------------
+with gr.Blocks(title="Binary Search Game") as demo:
     gr.Markdown(
         """
-        # 🔍 Binary Search Game  
-        Try to see how **Binary Search** finds your chosen number step by step!  
-        Pick any number between 1 and 100 and watch how the algorithm narrows down the range.
+        # 🎯 Binary Search Game  
+        The computer will randomly generate a sorted list of numbers (1–50).  
+        Try guessing a number (default: 1) and see how **binary search** works step by step!  
         """
     )
 
     with gr.Row():
-        user_number = gr.Textbox(label="Enter a number (1–100)")
-    output_box = gr.Textbox(label="Search Progress", lines=10)
+        user_number = gr.Number(label="Enter a number to search (1–50)", value=1, precision=0)
+    output_box = gr.Textbox(label="Search Steps", lines=12, interactive=False)
 
     run_button = gr.Button("Run Binary Search 🔎")
     run_button.click(play_binary_search, inputs=user_number, outputs=output_box)
@@ -70,13 +80,13 @@ with gr.Blocks(title="Binary Search Simulator") as demo:
     gr.Markdown(
         """
         ---
-        **How it works:**  
-        1. Binary Search always checks the middle of the range.  
-        2. If the guess is too high or too low, it halves the range again.  
-        3. It continues until it finds your number!
+        **How Binary Search Works:**  
+        1. Start with a sorted list.  
+        2. Compare your number to the middle element.  
+        3. If it's smaller, search the left half; if larger, search the right.  
+        4. Continue halving the range until the number is found or the list is empty.  
         """
     )
 
-# Run app locally or on Hugging Face
 if __name__ == "__main__":
     demo.launch()