Award-Winning Computer Science Tutors
serving Los Angeles, CA

Sarah's mathematics background means she's comfortable with the algorithmic and logical thinking that underpins computer science — concepts like recursion, Big-O analysis, and Boolean logic map directly onto the math she studied at Clark. She approaches programming problems the same way she approaches proofs: break the problem down, identify the structure, then build the solution step by step.

Learning to code is really learning to decompose problems, and that skill transfers whether the language is Java, Python, or something else entirely. Milan's CS degree grounds his teaching in fundamentals like control flow, data structures, and algorithmic complexity rather than surface-level syntax drills. He also draws on his English background to emphasize clear documentation and readable code.

Understanding data structures like arrays, linked lists, and sorting algorithms matters more than memorizing syntax — and that distinction is where Dennis spends most of his time. His background spans Java, JavaScript, and web development, so he can show how core CS concepts translate across languages and real projects.

I'm a recent graduate of the California Institute of Technology in Economics and Computer Science. I was also accepted at Harvard, Princeton, MIT, and Stanford. I have a broad range of interests spanning science, math, engineering, social science, the humanities, the arts, and athletics (I also played on the Caltech basketball team). My background allows me to tutor general college prep, especially the SAT, ACT and the GRE. I love to teach analytical thinking, ranging from advanced Math and Physics to strategies for understanding literature and developing arguments.

I am starting graduate school this fall. My experiences as a student and scientist help me explain concepts and work through problems in a clear and engaging manner. I love teaching, and strive to make each personalized lesson enjoyable and productive. In addition to math and science, I can teach the skills and strategies students need to reach their goals on the ACT, GRE, or AP tests. I also enjoy working with elementary age students to increase reading and math proficiencies.

Justin's PhD research in computational mathematics meant writing code daily — building simulations, implementing algorithms, and debugging in MATLAB and other languages. He teaches computer science concepts like data structures, recursion, and algorithmic complexity by connecting them to real computational problems rather than treating them as abstract definitions to memorize.

A Duke CS graduate now pursuing a Master's in Cybersecurity, Noah covers everything from foundational data structures and algorithms to systems-level concepts like memory management and network protocols. He breaks down abstract topics — recursion, Big-O analysis, object-oriented design — by connecting them to real problems rather than leaving them as textbook definitions. Students get someone who's still actively building in the field, not just teaching from notes.

A computer science degree paired with coursework in theoretical mathematics gives Lance an unusually strong grasp of the abstractions underneath the code — automata theory, algorithm complexity, data structures, and computational logic. He spent multiple semesters as a TA and independent instructor for CS courses, so he's seen firsthand which concepts trip students up and how to reframe them. Whether the topic is graph traversal or NP-completeness, he breaks it into pieces that actually make sense.

From recursion and sorting algorithms to Big-O analysis and object-oriented design, Ethan covers core computer science concepts with the rigor of someone studying it as a second major alongside aerospace engineering. He emphasizes understanding why an algorithm works — tracing through execution step by step — so students can adapt their thinking to new problems on exams and in projects.

Learning to code is really learning to decompose problems — figuring out what a program needs to do before writing a single line. Nat is double-majoring in computer science at Vanderbilt and unpacks core topics like loops, conditionals, data structures, and algorithm design in ways that build genuine understanding. Whether a student is writing their first Python script or debugging recursive functions, he connects each concept to the logic behind it.

Studying Computer Science alongside Math/Stats at Carleton College, Thomas lives at the intersection of algorithms, data structures, and mathematical reasoning. He digs into topics like recursion, sorting algorithms, and object-oriented design by building understanding from first principles rather than rote code memorization.

Between his coursework at Rice and his background in algorithms, Daniel tackles computer science from both the practical and theoretical sides — writing clean code and understanding why one sorting algorithm outperforms another for a given dataset. He's especially strong at breaking down recursion, data structures, and algorithmic complexity into steps that build logically on each other.

A Stanford MS in Computer Science means David can teach everything from data structures and algorithms to object-oriented design with the depth that comes from building real systems — not just reading about them. He spent a summer teaching web and app development to high school students in Palestine, so he knows how to make abstract CS concepts click through hands-on projects.

Corrina's mechanical engineering degree required extensive programming coursework, and she now teaches core computer science concepts — data structures, algorithms, Boolean logic, and computational thinking — in a way that makes abstract ideas tangible. She connects each concept to real applications, whether that's sorting algorithms in a search engine or conditionals inside a robot's control loop.

Madeline's physics PhD work at Carnegie Mellon means she writes code daily — Python, Java, MATLAB, and Mathematica — to model complex systems and crunch data, which is a very different entry point into computer science than a pure software track. That scientific computing background makes her especially effective at teaching programming logic, debugging strategies, and algorithmic thinking to students who need CS skills for STEM applications rather than just app development.

Studying computer science since before college and now pursuing a master's at UMass Amherst, Milo covers the full stack — from data structures and algorithms to systems-level concepts like memory management and concurrency. He spent three years in his university's tutoring center breaking down topics like recursion, sorting complexity, and graph traversal for students at every level.

Biomedical engineering at Rice requires heavy computational coursework, so Theresa has tackled core computer science concepts — from object-oriented programming and data structures to algorithm complexity — in the context of solving real problems. She explains abstract ideas like recursion and sorting algorithms by connecting them to concrete examples rather than letting students drown in theory. Rated 5.0 by students.