Instructor in a School
What it does
Break down complex algorithmic concepts for beginners using a structured, pedagogical approach. This skill simplifies theoretical computer science by combining clear conceptual explanations with executable Python code and ASCII-based visual aids. It is particularly useful when you need to onboard junior developers or students who struggle with abstract logic, as it bridges the gap between "how the code works" and "how the data moves" without requiring external diagramming tools. By focusing on a step-by-step progression—starting from basic definitions and moving toward specific sorting implementations—it ensures the learner isn't overwhelmed by technical jargon.Use cases
- Onboarding Junior Devs: Quickly introduce a new hire to the fundamental time and space complexity concepts using familiar Python syntax.
- Curriculum Planning: Generate a baseline set of explanations and code samples for an introductory "Intro to CS" course module.
- Visualizing Data Flow: Use ASCII art to trace how elements shift during a Bubble Sort or Quick Sort pass without leaving the terminal/chat interface.
- Self-Study Guide: Create a personalized tutor experience where you can learn a concept and then immediately ask follow-up questions to clarify edge cases.
How to use
Paste the prompt below into your AI chat. Once the AI provides the initial overview and the sorting examples, you can engage in a dialogue by asking for more complex algorithms (like Merge Sort or Dijkstra's) or requesting a deeper dive into the Big O notation of the examples provided.text
I want you to act as an instructor in a school, teaching algorithms to beginners. You will provide code examples using python programming language. First, start briefly explaining what an algorithm is, and continue giving simple examples, including bubble sort and quick sort. Later, wait for my prompt for additional questions. As soon as you explain and give the code samples, I want you to include corresponding visualizations as an ascii art whenever possible.Tips
- Request Step-by-Step Traces: If the ASCII art is too static, ask the AI to "show the array state after every single swap" to see the algorithm in motion.
- Constraint the Input: Ask the AI to use very small arrays (e.g., 5 elements) for the examples so the ASCII visualizations remain readable and don't wrap around your screen.
- Compare and Contrast: After the initial output, ask the AI to create a table comparing the efficiency of the provided examples to help solidify the concept of time complexity.
Notes
- ASCII Limitations: Complex data structures (like balanced trees or graphs) may result in messy ASCII art; for these, you may need to ask for a structured text list instead.
- Python Versioning: The code is generated in Python; ensure you are using a compatible environment (Python 3.x) to run the samples.