Getting comfortable with loops, conditionals, and functions early makes every future CS course easier — and Justin explains these building blocks by tying them to problems students can visualize, like simulating physics or processing data. His background spans physics, applied math, and programming, so he can show high schoolers why the code they're writing actually matters beyond the assignment.

Philosophy trains you to break complex arguments into precise logical steps — which turns out to be exactly what high school CS demands when students hit Boolean logic, nested conditionals, and algorithm design. Julie applies that structured reasoning to programming concepts, teaching students to think through what their code should do before they start typing. Her statistics and machine learning certificate at Princeton means she's no stranger to writing and debugging code herself.

That first real CS course can feel overwhelming when you're simultaneously learning to think algorithmically and wrestle with syntax errors. Kevin takes topics like loops, arrays, sorting algorithms, and basic object-oriented design and ties each one to a tangible problem so the logic sticks before the code gets more complex. His 5.0 rating speaks to how well that approach lands with students.

Between AP Computer Science A prep and general programming fundamentals, Clive covers the full scope of what high school CS courses demand — from writing clean loops and conditionals to understanding recursion and sorting algorithms. He codes in multiple languages and adapts explanations to whatever environment a student's class uses. His approach is to build each concept through small, testable programs so students can see results immediately.

For students encountering loops, conditionals, and arrays for the first time, the leap from "I followed the example" to "I can solve a new problem" is the hardest part. Anna bridges that gap by teaching structured problem decomposition — breaking a coding challenge into smaller logical steps before writing a single line. Her background spans multiple programming languages, so she adapts explanations to whatever language the course uses.

Getting through high school CS often means wrestling with your first real programming concepts — loops, conditionals, arrays, recursion — without much intuition for why they work. Florence, a Duke CS major and three-time teaching assistant, unpacks these ideas by connecting abstract logic to tangible examples, building the kind of problem-solving instincts that carry into AP Computer Science and beyond.

A lot of high school CS courses move fast from basic loops and conditionals into AP-level topics like recursion and array manipulation. Rhamy breaks each concept into small, buildable steps — writing actual programs rather than just reading pseudocode — so the logic sticks before the syntax piles up.

That first encounter with loops, conditionals, and functions can feel overwhelming when everything is new vocabulary. Allison breaks programming logic into small, testable pieces — write three lines, run them, see what happens — so students build intuition for debugging and problem decomposition before projects get complex. Rated 4.9 by students.

Robotics competitions and hackathons have given June a hands-on fluency with programming that translates directly to high school CS topics like loops, conditionals, data structures, and algorithm design. As an electrical engineering student at Brown, she writes code that has to actually run on hardware — so she's used to debugging methodically and explaining why a program behaves the way it does.

AP Computer Science and introductory programming courses often trip students up at the same points — loop logic, array manipulation, and understanding how methods pass data around. Michael's UCLA computer science background means he can trace through code line by line and show exactly where a student's reasoning diverges from what the machine actually does. That debugging-oriented approach builds real problem-solving instincts.

The jump from writing your first loop to actually thinking like a programmer is where most high schoolers get stuck — and it's exactly where Brice thrives. He breaks down concepts like conditionals, arrays, and basic algorithm design by connecting them to projects students actually want to build. His CS coursework at MIT keeps him sharp on both fundamentals and where the field is heading.

A Princeton postdoctoral researcher in machine learning, Firas brings PhD-level computer science depth to high school topics that often get taught superficially — things like how recursion actually works under the hood, or why an O(n²) sort matters even in an intro course. He teaches Python, Java, and JavaScript across his tutoring practice, so he can match whatever language a student's class uses and still keep the focus on the conceptual reasoning underneath. Rated 5.0 by students.