Summary

Keywords

full string iteration pattern recursive approach repetitive computation res-tll-004-stem-concept-videos-fall-2013 single letter string string manipulation substrings two-letter string

Full Transcript

MIT RES.TLL-004 Concept Vignettes View the complete course: http://ocw.mit.edu/RES-TLL-004F13 Instructor: Niaja Farve This video explains how programming problems can be broken into simpler yet similar problems, and then be solved recursively or iteratively. Students are presented with classic string manipulation problems and the Towers of Hanoi problem. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

ACCUPLACER Algebra & Functions Full COURSE - Updated weekly!

⭐ 4.0

8 ratings

3.5 hours

Affiliate Marketing Full Free Course (New Updated) by WsCube Tech

Embark on Your Affiliate Marketing Journey: Master Skills, Boost Earnings & Unlock Success with WsCube Tech's Comprehensive Step-by-Step Guide – Learn to Earn Big from Top Niches and Strategies, Whether You're a Beginner or Pro!

⭐ 5.0

3 ratings

12.3 hours