Update app.py

app.py

@@ -1,7 +1,5 @@
 import streamlit as st
 import time
-import random
-import numpy as np
 
 # Bubble Sort Algorithm with animation
 def bubble_sort(arr):
@@ -49,37 +47,95 @@ def animate_sorting(steps):
 
 # Streamlit App Interface
 def main():
-    st.title("Sorting Algorithms Visualization")
+    # Sidebar with two options: "Try Simulation" and "Detailed Explanation"
+    st.sidebar.title("Sorting Algorithm Options")
+    option = st.sidebar.radio("Choose an option:", ("Try Simulation", "Detailed Explanation"))
 
-    # Input array from user
-    user_input = st.text_input("Enter a list of numbers (comma separated):", "64, 34, 25, 12, 22, 11, 90")
-    
-    # Convert the input into a list of integers
-    if user_input:
-        try:
-            arr = [int(x) for x in user_input.split(',')]
-        except ValueError:
-            st.error("Please enter a valid list of integers.")
-            return
-        
-        # Select the sorting algorithm
-        algorithm = st.selectbox("Select sorting algorithm:", ("Bubble Sort", "Insertion Sort", "Selection Sort"))
+    if option == "Try Simulation":
+        st.title("Sorting Algorithms Visualization")
+
+        # Input array from user
+        user_input = st.text_input("Enter a list of numbers (comma separated):", "64, 34, 25, 12, 22, 11, 90")
         
-        # Start the animation on button press
-        if st.button('Sort'):
-            steps = []
-            if algorithm == "Bubble Sort":
-                steps = bubble_sort(arr)
-            elif algorithm == "Insertion Sort":
-                steps = insertion_sort(arr)
-            elif algorithm == "Selection Sort":
-                steps = selection_sort(arr)
+        # Convert the input into a list of integers
+        if user_input:
+            try:
+                arr = [int(x) for x in user_input.split(',')]
+            except ValueError:
+                st.error("Please enter a valid list of integers.")
+                return
+            
+            # Select the sorting algorithm
+            algorithm = st.selectbox("Select sorting algorithm:", ("Bubble Sort", "Insertion Sort", "Selection Sort"))
+            
+            # Start the animation on button press
+            if st.button('Sort'):
+                steps = []
+                if algorithm == "Bubble Sort":
+                    steps = bubble_sort(arr)
+                elif algorithm == "Insertion Sort":
+                    steps = insertion_sort(arr)
+                elif algorithm == "Selection Sort":
+                    steps = selection_sort(arr)
+
+                # Animate the sorting process
+                animate_sorting(steps)
 
-            # Animate the sorting process
-            animate_sorting(steps)
+                # Display the final sorted array
+                st.write("Sorted Array:", arr)
+    
+    elif option == "Detailed Explanation":
+        st.title("Detailed Explanation of Sorting Algorithms")
+
+        # Show explanations for each algorithm
+        algorithm = st.selectbox("Select an algorithm to see the explanation:", 
+                                 ("Bubble Sort", "Insertion Sort", "Selection Sort"))
+
+        if algorithm == "Bubble Sort":
+            st.subheader("Bubble Sort Explanation")
+            st.write("""
+                Bubble Sort is a simple sorting algorithm that works by repeatedly stepping through the list,
+                comparing adjacent elements and swapping them if they are in the wrong order. The pass through the
+                list is repeated until the list is sorted. It gets its name because the largest unsorted element
+                "bubbles" to its correct position in each pass.
+            """)
+            st.write("""
+                **Steps**:
+                1. Compare adjacent elements.
+                2. Swap them if they are in the wrong order.
+                3. Repeat this for each pair of adjacent elements in the array.
+                4. Continue until no more swaps are needed.
+            """)
+        
+        elif algorithm == "Insertion Sort":
+            st.subheader("Insertion Sort Explanation")
+            st.write("""
+                Insertion Sort is a simple comparison-based algorithm. It builds the sorted array one item at a time.
+                It works by picking the next item from the unsorted part of the array and inserting it into its correct position
+                in the sorted part of the array. The process is repeated until the whole array is sorted.
+            """)
+            st.write("""
+                **Steps**:
+                1. Start with the second element.
+                2. Compare it with the elements before it, and move those elements one position to the right if necessary.
+                3. Insert the element at the correct position.
+                4. Continue this process until all elements are inserted in the correct order.
+            """)
 
-            # Display the final sorted array
-            st.write("Sorted Array:", arr)
+        elif algorithm == "Selection Sort":
+            st.subheader("Selection Sort Explanation")
+            st.write("""
+                Selection Sort is a simple comparison-based algorithm that divides the array into two parts: the sorted part and
+                the unsorted part. In each pass, it selects the smallest (or largest, depending on the sorting order) element from
+                the unsorted part and swaps it with the first element of the unsorted part. This process is repeated until the array is sorted.
+            """)
+            st.write("""
+                **Steps**:
+                1. Find the smallest element in the unsorted part of the array.
+                2. Swap it with the first unsorted element.
+                3. Move the boundary of the sorted part one element forward.
+                4. Repeat this process for all elements.
+            """)
 
 # Run the app
 if __name__ == "__main__":