Interactive Code Playground

Execute Python code with real-time feedback and visualization

Python 3.11

NumPy Ready

Code Examples

Code Editor

# Welcome to CS Learning Hub Code Playground!
# Try some numerical methods and algorithms

import numpy as np
import matplotlib.pyplot as plt

# Bisection Method Example
def bisection_method(func, a, b, tolerance=1e-6):
    """Find root using bisection method"""
    if func(a) * func(b) >= 0:
        return None, "No root in interval"
    
    iterations = []
    while (b - a) / 2 > tolerance:
        c = (a + b) / 2
        iterations.append(c)
        if func(c) == 0:
            break
        if func(a) * func(c) < 0:
            b = c
        else:
            a = c
    
    return (a + b) / 2, iterations

# Example function: f(x) = x^3 - x - 2
def example_func(x):
    return x**3 - x - 2

# Find root
root, iterations = bisection_method(example_func, 1, 2)
print(f"Root found: {root:.6f}")
print(f"Iterations: {len(iterations)}")
print(f"Verification f({root:.6f}) = {example_func(root):.10f}")

# Quick sort visualization
def quicksort_with_steps(arr):
    if len(arr) <= 1:
        return arr, [arr.copy()]
    
    steps = [arr.copy()]
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    
    left_sorted, left_steps = quicksort_with_steps(left)
    right_sorted, right_steps = quicksort_with_steps(right)
    
    result = left_sorted + middle + right_sorted
    steps.extend([result])
    
    return result, steps

# Demo quicksort
demo_array = [64, 34, 25, 12, 22, 11, 90]
sorted_array, sort_steps = quicksort_with_steps(demo_array)
print(f"Original: {demo_array}")
print(f"Sorted: {sorted_array}")

Output

Click "Run Code" to see output here

Pro Tips

•Use NumPy for efficient numerical computations
•Add print statements to debug your algorithms
•Try the code examples to get started quickly

•Download your code for later use
•Check the metrics panel for performance insights
•Share interesting algorithms with the community