Lecture 8 | Programming Abstractions (Stanford)

Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance.

Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69

CS 106B Course Website:
http://cs106b.stanford.edu

Stanford Center for Professional Development:
http://scpd.stanford.edu/

Stanford University:
http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• recursion
• functional
• palindrome
• binary
• search

[nvpwns]

recursion really forces you to think hard

[tayadevijay]

fucker cougher

[rtcvb32]

Curious the recursions problem given, I had solved it with another project, making the answer quite interesting. 60 people, groups of 4, never the same exact group. The answer is 487,635.

[agapitoflores001]

Nice Lecture. It is worth listening. I mean watching. LOL.

[alpha128a]

MMMMMMM how to formulate larger answer .......... this sentence it self is a problem and needed to be explained

[KingslayerSrb]

god, that coughing is so annoying.. if you are sick, just skip the class pff

[shebotnov]

@pagola right, who needs universities anyway if you have youtube.

[pagola]

just watched outofmylab 8 minutes and he explains what she takes an hour to explain